rooted tree

(definition)

Definition: A tree in which one node is designated as the root.

Also known as oriented tree.

See also free tree.

Author: PMS

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 M. Sant, "rooted 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/rootedtree.html