Stack tree
 | This article may be confusing or unclear to readers. (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.
References
- An English-Persian dictionary of Algorithms and Data Structures http://ce.sharif.edu/~dic-ads/view.php?mode=3&value=S
 | This computer science article is a stub. You can help Wikipedia by expanding it. |