Heaps
- A heap (or, a min-heap) is a binary tree with two special properties
- It is almost complete
- All nodes are filled in, except the last level may have some nodes missing toward the right
- The tree fulfills the heap property
- All nodes store values that are at most as large as the values stored in their descendants
- Heap property ensures that the smallest element is stored in the root