(definition)
Definition: A node in a tree without any children. See the figure at tree.
Also known as external node, terminal node.
Aggregate parent (I am a part of or used in ...)
tree.
See also root, internal node.
Note: Every node in a tree is either a leaf or an internal node. The root may be a leaf.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 3 June 2005.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "leaf", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 3 June 2005. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/leaf.html
