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 ...)
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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 3 June 2005.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "leaf", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 3 June 2005. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/leaf.html