| Priority Queue |
16 points
A priority queue is an abstract data type that is useful when you are prioritizing something. We'll use it to prioritize people being seen in an emergency room. When the doctors and nurses are ready to see the next patient, the priority queue gives the name of the person waiting who has the greatest urgency (highest priority) to get medical attention. A patient's priority is on a 1 to 10 scale, with 10 being the most urgent. Since the most urgent case is associated with the largest number, we'll use a max-heap instead of a min-heap.
The tasks that you need to do to complete this program are discussed in the .java files that you will download. You can download HeapTest.java, ERPatient.java and MaxHeap.java to use while writing your program.
You can download MyPriorityQueue.jar, which will show how your program might run when it is done.