Binary Heap Priority Q Data Structure
Heap-order property
- parent’s key is less than children’s keys
- result: minimum is always at the top
Structure property
- complete tree with fringe nodes packed to the left
- result: depth is always O(log n); next open location always known
How do we find the minimum?