#include<iostream.h>
#include<conio.h>
#define max 10 //Maximum Size of Stack
int stack[max];
int top=-1,item; //top=-1 means Stack is Empty.
//First Element will be stored at Zero Location. (top=0)
void main()
{
clrscr();
int choice;
void Push();
void Pop();
void Display();
for(;;) //Infinite Loop.
{
cout<<"\n\n\n\n---------- STACK ---------- \n";
cout<<"\nMain Menu\n\n1. PUSH\n2. POP\n3. Display\n4. Exit\n\nEnter your choice : ";
cin>>choice;
switch(choice)
{
case 1:
Push();
break;
case 2:
Pop();
break;
case 3:
Display();
break;
case 4:
return; //Exit
default:
cout<<"\nWrong Input";
}
}
}
void Display() //Display's the Element of Stack.
{
int i;
if(top==-1)
{
cout<<"\nStack is Empty.\n";
}
else
{
for(i=top;i>=0;i--)
{
cout<<endl<<"Stack["<<i<<"]="<<stack[i];
if(i==top)
cout<<" <-- Top";
}
}
}
void Push() //Insert a New Element in Stack.
{
if(top==max-1)
{
cout<<"\nOverflow\n";
}
else
{
cout<<"\nEnter the Element you want to Insert : ";
cin>>item;
top=top+1;
stack[top]=item;
cout<<endl<<item<<" is Inserted at Top.\n";
Display();
}
}
void Pop() //Delete Element from Stack.
{
if(top==-1)
{
cout<<"\nUnderflow\n";
}
else
{
item=stack[top];
top=top-1;
cout<<endl<<item<<" is Deleted from Top.\n";
Display();
}
}
| Web Pages by Students |
ABC of C Language by Shailender Sharma |
Bootable Pen Drive by Avtar Singh |
e-Trash or e-Treasure ? by Pallavi Bagga |
Lakshya by Rabina Bagga |
OOPs Concepts by Navjot Kaur |
Fitness First by Ankush Rathore |
Information Systems by Kajal Gupta |
Quiz Contest in C++ by Rajnish Kumar |
Core Java (Tutorial) by Shyena |
C Language Q&A by Anmol Sharma |
HTML 5 Tutorial by Kishan Verma |