Definition: A node of a tree that has one or more child nodes, equivalently, one that is not a leaf.
Also known as nonterminal node.
See also parent, root.
Note: See [CLR90, page 93] or [HS83, page 220].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Lawrence J. Wobker and Paul E. Black, "internal node", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/internalnode.html