(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 E. Black.
Entry modified 17 December 2004.
HTML page formatted Wed Feb 4 11:02:22 2009.
Cite this as:
Paul M. Sant, "rooted tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/rootedtree.html
