ordered tree

(data structure)

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.

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "ordered tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: