Chapter 14, Problem 1TQ

Program Plan Intro

Stack:

• Stack is an abstract data type where the access of a data is made at only one end.
• In the stack, the data can be inserted or removed at the same end.
  • The first item inserted moves to the last when inserting other new items. So, the first item inserted was retrieved last. This mechanism is referred to as last-in-first-out (LIFO).
• Insertion and deletion are the common operations of the stack.
  • Inserting an item into the stack is called push.
  • Removing an item from the stack is called pop.

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 priority, the other items are removed.
  • That is, either the maximum number or the minimum number can be deleted by using deletemaximum() or deleteminimum() function.
  • Deletemaximum() is a function which deletes the number which is having a higher priority.