Chapter 4, Problem 8E

Program Plan Intro

Stack:

Stack is a container in which elements inserted and removed in LIFO (Last In First Out) manner.

• The “top” is address of top element of stack.
• Basic stack operations are given below:
  • push(): Insert an object into stack top.
  • pop(): Delete object in stack top.
  • topEl(): Get object in stack top.
  • isEmpty(): Check stack is empty or not.

Queue:

• Queue is another data structure in which insertion and removal of elements are in FIFO (First In First Out) manner.
• Basic operations are given below:
  • Enqueue(): Insert an element into back of queue
  • Dequeue(): Remove an item from front of queue
  • front(): Get first element of queue without removal of it.
  • isEmpty(): Check queue is empty or not.