Chapter 14.2, Problem 12SCP

Program Plan Intro

Stack:

• Stack works based on the Last-In-First-Out (LIFO) structure.
• There are two method are used,
  • “push()”:
    • The element is inserted to the top of the stack using this method.
    • Whenever the user tries to inserts the element into the stack, the last element which is currently to be inserted will be at the top of the stack.
  • “pop()”:
    • The element at the top of the stack is popped out using this method.
    • This method returns and deletes the element from the top of the stack.
    • The element which is inserted last will be removed first from the stack.

Queue:

• Queue works based on the First-In-First-Out (FIFO) structure.
• The elements are inserted into the queue only at the rear end.
• The elements can be deleted only at the front end.
• Two important  methods are used in queue,
  • “add()” : To insert the element at the rear end of the queue, this method is used.
  • “remove()”: To remove the element at the front end of the queue, this method is used.

Explanation of Solution

Advantages:

• Stack or queues are useful to represent many common operations.
• If the user has the index or key, then the lists or maps provide instant access to any of its corresponding elements...