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.

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 3 June 2005.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Paul E. Black, "leaf", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 3 June 2005. (accessed TODAY) Available from: