Definition: A complete tree where every node has a key more extreme (greater or less) than the key of its parent. Each node has k or fewer children.
See also k-ary tree, binary heap, heap.
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:
Chris L. Kuszmaul, "k-ary heap", 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/karyheap.html