Stack tree

From Wikipedia, the free encyclopedia

All or part of this article may be confusing or unclear.
Please help clarify the article. Suggestions may be on the talk page. (December 2006)

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.