-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack.cpp
116 lines (101 loc) · 2.36 KB
/
stack.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include<iostream>
#define MAX 5
using namespace std;
int STACK[MAX],TOP,n;
//stack initialization
void initStack(){
TOP=-1;
}
//check it is empty or not
int isEmpty(){
if(TOP==-1)
return 1;
else
return 0;
}
//check stack is full or not
int isFull(){
if(TOP==MAX-1)
return 1;
else
return 0;
}
void push(int num){
if(isFull()){
cout<<"\n\t\t\tSTACK is FULL."<<endl;
return;
}
++TOP;
STACK[TOP]=num;
cout<<"\n\t\t\t" << num <<" has been inserted."<<endl;
}
//returns the top data value of the stack
void peek()
{
if (!isEmpty()) {
cout<<"\n\t\t\t" <<"Top member is : "<< STACK[TOP];
return;
}
else{
cout<<"\n\t\t\t Stack is empty"<<endl;
}
}
void display(){
int i;
if(isEmpty()){
cout<<"\n\t\t\tSTACK is EMPTY."<<endl;
return;
}
for(i=TOP;i>=0;i--){
cout<<"\t"<< STACK[i];
}
cout<<endl;
}
//pop - to remove item
void pop(){
int temp;
if(isEmpty()){
cout<<"\n\t\t\tSTACK is EMPTY."<<endl;
return;
}
temp=STACK[TOP];
TOP--;
cout<<"\n\t\t\t"<<temp <<" has been deleted."<<endl;
}
int main(){
int num;
initStack();
char ch;
do{
int a;
cout<<"\n\t\t.........Stack Operations Implementatation...............\n";
cout<<"\n\t\t\t1.Push()\n";
cout<<"\n\t\t\t2.Pop()\n";
cout<<"\n\t\t\t3.Display()\n";
cout<<"\n\t\t\t4.Peek()\n";
cout<<"\n\t\tPlease enter your choice: ";
cin>>a;
switch(a)
{
case 1:
cout<<"\n\t\t\tEnter an Integer Number: ";
cin>>num;
push(num);
break;
case 2:
pop();
break;
case 3:
display();
break;
case 4:
peek();
break;
default :
cout<<"\n\t\t\tAn Invalid Choice!!!\n";
}
cout<<"\n\t\t\tDo you want to continue ? (y/n) ";
cin>>ch;
}while(ch=='Y'||ch=='y');
return 0;
}