// Implementation of a stack as an array

#include<iostream.h>
#include<conio.h>
#include<process.h>
class stack
{
int num[10],top,max;
public:
stack()
{
top=-1;
max=9;
}
void push(int n)
{
if(top==max)
cout<<"\nStack Overflow,Push not Possible";
else
{
top++;
num[top]=n;
}
}
void pop()
{
if(top==-1)
cout<<"\nStack Underflow,Stack does not exist";
else
{
int temp=num[top];
top--;
cout<<"\nDeleted Number is:"<<temp;
}
}
void traverse();
}st;
void stack::traverse()
{
if(top==-1)
cout<<"\nStack Underflow";
else
for(int i=top;i>=0;i--)
cout<<num[i]<<" ";
}
void main()
{
clrscr();
int ch,no;
menu:
cout<<"\nMenu\n1.Push\n2.Pop\n3.Traverse\n4.Exit\nEnter Your Choice:";
cin>>ch;
switch(ch)
{
case 1:
cout<<"\nEnter number:";
cin>>no;

st.push(no);
break;
case 2:
st.pop();
break;
case 3:
st.traverse();
break;
case 4:
getch();
exit(0);
default:
cout<<"\nWrong Choice!Please Re-enter";
}
goto menu;
}
//OUTPUT
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:1
Enter number:42
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:1
Enter number:24
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:1
Enter number:22
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:3
22 24 42
Menu
1.Push
2.Pop
3.Traverse

4.Exit
Enter Your Choice:2
Deleted Number is:22
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:3
22 24 42
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:2
Deleted Number is:22
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:3
24 42
Menu
1.Push
2.Pop
3.Traverse
4.Exit
Enter Your Choice:4