Definition: A tree where the children of every node are ordered, that is, there is a first child, second child, third child, etc.
Note: An unordered tree may be thought of as a recursive bag, while an ordered tree is a recursive list.
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, "ordered 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/orderedtree.html