Templated Stack Implementation

Challenge

Write a program that has a templated Stack class that implements the Stack data structure. Both additions and deletions to the stack should happen at the same end called the top. Make sure to check whether the stack is full before adding a new element and whether the stack is empty before removing an existing element from it.

Sample run

Here’s what you should see when you run the program.

Element 10 added to stack
Element 20 added to stack
Element 30 added to stack
Stack is full
Element popped from stack = 30
Element popped from stack = 20
Element popped from stack = 10
Stack is empty

Coding exercise

Your job is to define and implement a templated Stack class with all the methods being called from the main( ) function. Try to solve this challenge on your own. If you can’t solve it, you can look at the solution and explanation below.