(definition)
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
An illustration of what heap property means followed by how it is used in help sort.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 6 April 2023.
HTML page formatted Fri Apr 7 09:27:46 2023.
Cite this as:
Paul E. Black, "heap property", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 6 April 2023. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/heapproperty.html