EX NO 14 Implement Stack of CPP
EX NO 14 Implement Stack of CPP
1. Stack Initialization
2. Push Operation
3. Pop Operations
4. Check Empty
5. Check Full
6. Stack Traversing to Display Stack Items
#include<iostream>
#define SIZE 5
class STACK
{
private:
int num[SIZE];
int top;
public:
STACK(); //defualt constructor
int push(int);
int pop();
int isEmpty();
int isFull();
void displayItems();
};
STACK::STACK(){
top=-1;
}
int STACK::isEmpty(){
if(top==-1)
return 1;
else
return 0;
}
int STACK::isFull(){
if(top==(SIZE-1))
return 1;
else
return 0;
}
int STACK::pop(){
//to store and print which number
//is deleted
int temp;
//check for empty
if(isEmpty())
return 0;
temp=num[top];
--top;
return temp;
void STACK::displayItems(){
int i; //for loop
cout<<"STACK is: ";
for(i=(top); i>=0; i--)
cout<<num[i]<<" ";
cout<<endl;
}
int main(){
//declare object
STACK stk;
int choice, n,temp;
do
{
cout<<endl;
cout<<"0 - Exit."<<endl;
cout<<"1 - Push Item."<<endl;
cout<<"2 - Pop Item."<<endl;
cout<<"3 - Display Items (Print STACK)."<<endl;
switch(choice){
case 0: break;
case 1:
cout<<"Enter item to insert: ";
cin>>n;
temp=stk.push(n);
if(temp==0)
cout<<"STACK is FULL."<<endl;
else
cout<<temp<<" inserted."<<endl;
break;
case 2:
temp=stk.pop();
if(temp==0)
cout<<"STACK IS EMPTY."<<endl;
else
cout<<temp<<" is removed (popped)."<<endl;
break;
case 3:
stk.displayItems();
break;
default:
cout<<"An Invalid choice."<<endl;
}
}while(choice!=0);
return 0;