## Heaps also satisfy the heap property:

- In other words, the value of a node is at most the value of its parent
- The largest value is thus stored at the root (A[1])

## Because the heap is a binary tree, the height of any node is at most ?(lg n)

Previous slide | Next slide | Back to first slide | View graphic version |