## Resulting heap

Every node has the heap property: it is smaller than its children, with the smallest element being at the top. (min-heap)

## The heap stored as an array

The element at index k (starting from 0) is smaller than the elements at indices 2*k+1 and 2*k+2.