Definition: A k-ary tree with all leaf nodes at same depth. All internal nodes have degree k.
Generalization (I am a kind of ...)
See also perfect binary tree.
Note: Called "complete" by [CLR90, page 95].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 20 April 2011.
HTML page formatted Mon Nov 18 10:44:10 2013.
Cite this as:
Paul E. Black, "perfect k-ary tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 20 April 2011. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/perfectKaryTree.html