Min Heap

Tags

comp-sci

A heap with the min heap property:

For every node \( n \) (other than the root) the value of that node is no smaller than its parent. \[ \forall i \in N A[\text{Parent}(n)] \leq A[n] \]

From this it follows that the root-node of a min-heap is the smallest element of the heap.

The procedure and workflow of a min-heap works much like a max-heap.