-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstackexception.cpp
71 lines (71 loc) · 1.02 KB
/
stackexception.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
#include<iostream>
using namespace std;
const int stmax = 5;
class element
{
public:
int key;
}
element stack[stmax];
int top = -1;
void push(int a)
{
if(top==-2) top++;
stack[++top].key = a;
}
element pop()
{
try
{
if(top==-1) throw(top);
return stack[top--];
}
catch(int &x)
{
cout<<”Exception thrown: Stack overflow\n”;
}
element temp;
temp.key = -1
return temp;
}
int main()
{
int choice,value;
element temp;
for(;;)
{
cout<<endl;
cout<<”Enter operation to be performed\n”;
cout<<”1.Push\n”<<”2.Pop\n”<<”3.Exit\n”;
cin>>choice;
switch(choice)
{
case 1:
try
{
if((top+1)==stmax) throw(top);
cout<<”Enter the value\n”;
cin>>value;
push(value);
}
catch(int &max)
{
cout<<”Exception thrown: Stack overflow\n”;
}
break;
case 2:
temp =pop();
if(top==-1 && temp.key==-1)
{
cout<<”stack empty”<<endl;
break;
}
else cout<<”popped element”<<temp.key<<endl;
break;
default:
case 3:
cout<<”End of program\n”
return 0;
}
}
}