whether the Stack is empty or not. Time Complexity should be: O(1) bool full() : Returns whether the Stack is full or not. Time Complexity should be: O(1) int size() : Returns the current size of the Stack. Time Complexity should be: O(1) Type top () : Returns the last element of the Stack. Time Complexity should be: O(1) void push(Type) : Adds the element of type Type at the top of the stack. Time Complexity    should be: O(1) Type pop() : Deletes the top most element of the stack and ret

Stack:

Stacks are a type of container with LIFO (Last In First Out) type of working, where a new element is added at one end and (top) an element is removed from that end only. Your Stack should not be of the fixed sized. It should be able to grow itself.

bool empty() : Returns whether the Stack is empty or not. Time Complexity should be: O(1)

bool full() : Returns whether the Stack is full or not. Time Complexity should be: O(1)
int size() : Returns the current size of the Stack. Time Complexity should be: O(1)
Type top () : Returns the last element of the Stack. Time Complexity should be: O(1)

void push(Type) : Adds the element of type Type at the top of the stack. Time Complexity    should be: O(1)

Type pop() : Deletes the top most element of the stack and returns it. Time Complexity    should be: O(1)

• Write non-parameterized constructor for the above class.
• Write Copy constructor for the above class.
• Write Destructor for the above class.

Now write a global function show stack which should display all the contents of the stack.

 void showStack(Stack <Type> s);

Instantiate several objects of Stack, test all the functions of Stack on them and then display them through showStack function.

Program in C++.

compile on visual studio.