#include
#include
#include
#include
#define MAX 10 // MAXIMUM STACK CONTENT
template
// stored in Stack without multiple defination of class
class stack
{
protected:
T arr[MAX]; // Contains all the Data
public:
T item,r;
int top; //Contains location of Topmost Data pushed onto Stack
stack() //Constructor
{
for(int i=0;i
arr[i]=NULL; //Initialises all Stack Contents to NULL
}
top=-1; //Sets the Top Location to -1 indicating an empty stack
}
void push(T a) // Push ie. Add Value Function
{
top++; // increment to by 1
if(top
arr[top]=a; //If Stack is Vacant store Value in Array
}
else // Bug the User
{
MessageBox(0,"STACK IS FULL","STACK WARNING!",MB_ICONSTOP);
top--;
}
}
T pop() // Delete Item. Returns the deleted item
{
if(top==-1)
{
MessageBox(0,"STACK IS EMPTY\n","WARNING",MB_ICONSTOP);
return NULL;
}
else
{
T data=arr[top]; //Set Topmost Value in data
arr[top]=NULL; //Set Original Location to NULL
top--; // Decrement top by 1
return data; // return deleted item
}
}
};
void main()
{
stack
int opt=1;
while (opt!=3)
{
clrscr();
cout<<"PATIHAN ARDI M\n";
cout<<"1A/14\n";
cout<<"0731140050\n\n\n";
cout<<" MAX STACK CAPACITY="<<((MAX-a.top)-1)<<"\n\n\n\n";
cout<<"1) Push Item\n";
cout<<"2) Pop Item\n";
cout<<"3) Exit\n\n";
cout<<"Option?";
cin>>opt;
switch(opt)
{
case 1:
cout<<"Which Number should be pushed?";
cin>>a.item;
a.push(a.item);
break;
case 2:
a.r=a.pop();
cout<<"Item popped from Stack is:"<
}
}
}
Kamis, 08 Mei 2008
Stack dengan ops
Label:
Struktur Data
Langganan:
Posting Komentar (Atom)
welcome to my world
you will enjoyed with this program and information.
Comment Form under post in blogger/blogspot