heap property

The rule that every parent in a heap is ordered before its children: no larger than them in a min-heap.

In more detail

It is weaker than the BST rule: siblings can be in any order, so a heap is not sorted and cannot be searched quickly. It only guarantees that the root is the extreme value, which is all a priority queue needs.

Related terms

Taught in

References