Chapter A, Problem 2E

Program Plan Intro

Priority Queue:

• If the items in the queue are related with a priority, then it is called priority queue.
• When inserting an item into the priority queue, the item is added with the priority.
• When removing an item from the priority queue, the item with higher priority is first removed. Then, based on the priority, the other items are removed.
• Priority queue can be implemented as an array, heap, or some other structure.
• Priority queue can be used as a queue.
  • When inserting a number into the priority queue, the high priority to low priority can be given in the order they are inserting.
  • That is, the first entered element should have the highest priority and the priority is decreased as the items are inserted further.
  • So, by using the deletemaximum() function, the first inserted item is taken out first.