(definition)
Definition: A binary tree where no node, except the root, has more than one non-leaf child.
Note: This topology is used to define simple, fault-tolerant, acyclic networks. See Ann T. Tai, Savio N. Chau, and Leon Alkalai, "COTS-Based Fault Tolerance in Deep Space: Qualitative and Quantitative Analyses of a Bus Network Architecture," in Proceedings of the 4th International IEEE High-Assurance Systems Engineering Symposium (HASE '99), November 1999, Washington, D.C., pages 97 - 104.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "stack tree", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/stacktree.html