You are on page 1of 2

#include <iostream.

h>
#include <conio.h>
#include <stdio.h>
#define size 7

class stack
{
private:

int a[size] ;
int top ;

public :

stack()
{
top = -1 ;
}

void push() ;
int pop() ;
void display() ;

};

void stack::push()
{
clrscr() ;
if ( top==size-1 )
cout<<"Stack overflow\n" ;

else
{
top++ ;
cout<<"Enter value\n" ;
cin>>a[top] ;
cout<<"Added "<<a[top] ;
}

int stack::pop()
{
clrscr() ;
if(top==-1)
{
cout<<"Stack empty\n" ;
return -1 ;
}

else
{
int item = a[top] ;
top-- ;
return item ;
}
}

void stack::display()
{
if(top ==-1)
{
cout<<"\nStack empty!!\n" ;
}

clrscr() ;
cout<<"\nThe elements are\n" ;
for(int i=top ; i>=0 ; i-- )
cout<<a[i]<<" " ;
}

void main()
{
stack var ;

int choice ;
do
{
cout<<"\nChoose operation\n" ;
cout<<"1.push 2.pop 3.display 4.Exit\n" ;
cin>>choice ;
switch(choice)
{
case 1 : var.push() ;
break ;
case 2 : cout<<"Removed"<<var.pop() ;
break ;
case 3 : var.display() ;
break ;
}
}while(choice!=4) ;
clrscr() ;
}

You might also like