#include #include #define SIZE 10 using namespace std; template class stack { public: T *a; int top,capacity; stack(int size=SIZE); void push(T e); T pop(); T peek(); bool isfull(); bool isempty(); }; template stack ::stack(int size) { a=new T[size]; top=-1; capacity=size; } template void stack::push(T e) { if(isfull()) { cout<<"STACK OVERFLOW\n"; exit(1); } cout<<"\tINSERTING::"< T stack::pop() { if(isempty()) { cout<<"STACK UNDERFLOW\n"; exit(1); } else { cout<<"\tREMOVING::"< 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 RANDOM STACK****\n"; stack ob; ob.push(rand()); ob.push(rand()); ob.push(rand()); ob.push(rand()); ob.push(rand()); ob.push(rand()); ob.push(rand()); ob.push(rand()); ob.pop(); ob.pop(); ob.pop(); ob.pop(); ob.pop(); int j=ob.peek(); cout<<"TOP ELEMENT IS::"<

random_stack;)