NIST

free tree

(definition)

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].

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:07 2018.

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: https://www.nist.gov/dads/HTML/freetree.html