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: Authors differ in their definitions. This is called "complete" by [CLR90, page 95].
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 21 January 2020.
HTML page formatted Tue Jan 21 16:28:40 2020.
Cite this as:
Paul E. Black, "perfect k-ary tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 21 January 2020. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/perfectKaryTree.html