Jump to content

Stack tree

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Metacosm (talk | contribs) at 21:13, 16 August 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A stack tree is a binary tree where no node other than the root has more than one non-leaf child. As the elements of a binary tree have 2 children, this means that one points to the next node (and hence is a non-leaf child) and one points to a data element, or NULL. Hence the tree is essentially a singly linked linked list, with data items hanging off each node.

References

  • An English-Persian dictionary of Algorithms and Data Structures [1]
  1. ^ http://ce.sharif.edu/~dic-ads/view.php?mode=3&value=S
Retrieved from "https://en.wikipedia.org/w/index.php?title=Stack_tree&oldid=70095575"