forked from Nexengineer/DSA-PREP
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStackUsingArray.cpp
151 lines (119 loc) · 1.72 KB
/
StackUsingArray.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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#include<iostream>
using namespace std;
class stack
{
public:
int top;
int arr[5];
stack()
{
top=-1;
bool isEmpty()
{
if(top==-1)
{
return true;
}
else
{
return false;
}
}
bool isFull()
{
if(top==4)
{
return true;
}
else
{
return false;
}
}
void push(int val);
void pop();
void display();
};
void stack :: push(int val)
{
if(isFull())
{
cout<<"Stack is overflow";
}
else
{
top++;
arr[top]=val;
}
}
void stack :: pop()
{
if(isEmpty())
{
cout<<"Stack underflow";
}
else
{
int item=arr[top];
top--;
}
}
void stack :: display()
{
cout<<"\nYour Stack is as follows: \n";
for(int i=top;i>=0;i--)
{
cout<<"\t";
cout<<arr[i]<<"\n";
}
}
int main()
{
int ch,val,start=1;
stack s1;
while(start==1)
{
cout<<"\n1)Push\n2)Pop\n3)isEmpty\n4)isFull\n";
cout<<"\nEnter your choice: ";
cin>>ch;
switch(ch)
{
case 1:
cout<<"\nEnter value to be push: ";
cin>>val;
s1.push(val);
s1.display();
break;
case 2:
s1.pop();
s1.display();
break;
case 3:
if(s1.isEmpty())
{
cout<<"\n\nStack is Empty";
}
else
{
cout<<"\n\nStack is not Empty";
}
break;
case 4:
if(s1.isFull())
{
cout<<"\n\nStack is Overflow";
}
else
{
cout<<"\n\nStack is Underflow";
}
break;
default:
cout<<"\nIncorrect choice !!";
}
cout<<"\nEnter 1 to continue: ";
cin>>start;
}
cout<<"\nThankyou !!!";
return 0;
}