(definition)
Definition: A k-ary tree with all leaf nodes at same depth. All internal nodes have degree k.
See also complete graph, full binary tree, complete binary tree.
Note: Called "complete" by [CLR90, page 95].
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Wed Feb 4 11:02:22 2009.
Cite this as:
Paul E. Black, "perfect k-ary tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/perfectKaryTree.html
