Reading material

Pages 221-224 and 227-230 and 246-248.

Additional material

HeapPriorityQueue.java

Assume we have the following heap.

Removing the minimal element takes the following steps.

Inserting an element with key 8 takes the following steps.