Jump to content

Stack tree

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jumping4JESUS (talk | contribs) at 03:18, 27 September 2013 (References). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A stack tree is a binary tree where no node besides 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

example [1]