Chapter 5, Problem 5R

Explanation of Solution

Stack:

• The stack is a container of objects. It uses the last-in-first-out(LIFO) order to insert and remove the objects.
• There are only two operations are allowed in pushdown stacks. The operations are, push the item into the stack and pop the item from the stack.
• The data structure stack is very limited access data structure. The elements of the stack can be inserted or removed only from the top of the stack.
• The operation “push” adds the element at the top of the stack.
• The operation “pop” delete the element from the top of the stack.
• For example, consider a stack of books where the user can add the book only at the top of the stack and the user can remove the books only from the top of the stack.
• A stack is a recursive data structure.

Output of series of operations

Push(5)

5

Push(3)

3

5

Pop() =>removes top element 3

5

Push(2)

2

5

Push(8)

8

2

5

Pop() =>removes top element 8

2

5

Pop() =>removes top eleme...