#include #include #define SIZE 10 using namespace std; template class stack { public: T *a; stack (int size=SIZE); ~stack(){ cout<<"\t**DELETING ALL STACKS\n**"; delete a; } int top,capacity; void push(T e); T pop(); bool isfull(); bool isempty(); T peek(); }; template stack::stack(int size) { a=new T[size]; capacity=size; top=-1; } template void stack::push(T e) { if(isfull()) { cout<<"STACK OVERFLOW\n"; exit(1); } cout<<"INSERTING::"< T stack::pop() { if(isempty()) { cout<<"STACK UNDERFLOW\n"; exit(1); } cout<<"REMOVING::"< T stack::peek() { if(!isempty()) { return a[top]; } else { exit(1); } } template bool stack::isempty() { if(top==-1) { return 1; } else { return 0; } } template bool stack::isfull() { if(top==capacity-1) { return 1; } else { return 0; } } int main() { cout<<"_______WELCOME TO GENERIC STACK_______\n"; stack s1; cout<<"*************INTEGER STACK**********\n"; s1.push(12); s1.push(8); s1.push(10); s1.push(6); s1.push(5); s1.pop(); s1.pop(); s1.pop(); s1.pop(); int i; i=s1.peek(); cout<<"TOP ELEMENT IS::"< c1; cout<<"*************CHARACTER STACK**********\n"; c1.push('a'); c1.push('b'); c1.push('c'); c1.push('e'); c1.push('f'); c1.pop(); c1.pop(); c1.pop(); c1.pop(); char j; j=c1.peek(); cout<<"TOP ELEMENT IS::"< f1; cout<<"*************FLOAT STACK**********\n"; f1.push(12.2); f1.push(8.23); f1.push(10.56); f1.push(6.98); f1.push(5.56); f1.pop(); f1.pop(); f1.pop(); f1.pop(); float k; k=f1.peek(); cout<<"TOP ELEMENT IS::"<

generic_stack