Sample Programming Assignment
Chapter 10
Priority Queue Implemented with a Heap
Read Section 10.1 of the text. Use the ideas there to implement a
a priority queue with at least the three operations of Figure 7.12.
Since the heap is a complete binary tree, it should be stored in
an array as described in Section 9.2.