Stack - Push Operation

// Exercise 15 - Push Operation in Stack.

#include<iostream.h>

#include<conio.h> #include<stdlib.h> #define MAX 3 class Stack { private: int s[MAX], top; public: Stack( ) // Constructor to initialize TOP pointer { top = -1; } void push(int); // Member Function Declaration void display( ); }; void Stack::push(int item) { if(top == MAX-1) cout<<"Stack is Full....Overflow!!!"<<endl; else { top++; s[top]=item; } } void Stack::display( ) { if(top == -1) cout<<"Empty Stack!!!"<<endl; else { for(int i=0; i<=top; i++) cout<<endl<<s[i]; cout<<"-->top element"<<endl; } getch( ); } void main( ) { Stack s; int choice, ele; clrscr( ); while(1) { cout<<"Stack Push Operation Menu"<<endl; cout<<"1. PUSH"<<endl; cout<<"2. DISPLAY"<<endl; cout<<"3. EXIT"<<endl; cout<<"Enter your Choice"<<endl; cin>>choice; switch(choice) { case 1: cout<<"Push Operation"<<endl; cout<<"Enter the value of element:"<<endl; cin>>ele; s.push(ele); break; case 2: cout<<"Stack elements are:"<<endl; s.display( ); break; case 3: cout<<"End of Stack Operation"<<endl; getch( ); exit(1); default:cout<<"Invalid choice.....!!!"<<endl; } getch(); } }