Definition: A connected, acyclic, undirected graph.
See also tree, rooted tree.
Note: This differs from the usual notion of a tree in that it does not have a root. This differs from a forest in that it is connected.
After [CLR90, page 91].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Paul E. Black, "free tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/freetree.html