(data structure)
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.
Author: CLK
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Chris L. Kuszmaul, "k-ary heap", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/karyheap.html