heap property


Definition: Each node in a tree has a key which is more extreme (greater or less) than or equal to the key of its parent.

Specialization (... is a kind of me.)
max-heap property, min-heap property.

Aggregate parent (I am a part of or used in ...)
binary heap, heap, binary priority queue.

Note: The root node has the largest or smallest key. After LK.

A complete tree with the heap property is a heap.

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

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:
Paul E. Black, "heap property", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: