Scribd
Upload
6 views3 pages

C++ Stack Implementation Example

Uploaded by

siddkamble2004
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views3 pages

C++ Stack Implementation Example

Uploaded by

siddkamble2004
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

TITLE: PROGRAM ON STACK

#include<iostream.h>
#include<conio.h>
#define MAX 5
class stack
{
int arr[MAX];
int top;
public:
stack(){
top = -1;
}
void push (int X) {
if (top== MAX - 1)
{
cout<<"\nstack overflow!";}
else {
top++;
arr[top] = X;
cout << "\ninserted" << X << "into the stack.";
}
}
void pop(){
if (top == -1) {
cout<<"\nstack underflow!"; }
else {
cout << "\ndeleted element: "<< arr[top];
top--;
}
}
void display() {
if(top == -1) {
cout << "\nstack id empty!";
return;
}
cout << "\nstackelement are:\n";
int i=top;
while (i>=0) {
cout<<arr[i]<<" ";
i=i-1;
}
}
};
void main() {
clrscr ();
stack s;
int choice, val;
do {
cout<< "\n\n_ _ _ stack menu _ _ _";
cout<< "\[Link]";
cout<< "\[Link]";
cout<< "\[Link]";
cout<< "\[Link]";
cout<< "\nenter your choice:";
cin >> choice;
switch (choice) {
case 1:
cout << "enter value to push:";
cin >> val;
[Link](val);
break;
case 2:
[Link]();
break;
case 3:
[Link]();
break;
case 4:
cout<< "\nexiting_ _ _";
break;
default:
cout<< "ninvalid choice!";
}
}
while (choice !=4);
getch();

}
OUTPUT:

You might also like