DataStructure/5_Stack_using_Arraycpp at master · rohangoyal755/DataStructure · GitHub

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
#include <iostream>

using namespace std;

#define n 100

class Stack
{
    int t=-1;
    int a[n];
public:
    void push()
    {
	int x;
	cin>>x;
        if(t==n-1)
        {
            cout<<"Stack Overflow"<<endl;
        }
        else
        {
            t=t+1;
            a[t]=x;
        }
    }
    void pop()
    {
        if(t<0)
        {
            cout<<"Stack Underflow"<<endl;
        }
        else
        {
            a[t]=NULL;
            t--;
        }
    }
    void peek()
    {
        if(t<0)
        {
            cout<<"Empty Stack"<<endl;
        }
        else
        {
            cout<<a[t]<<endl;
        }
    }
    bool isEmpty()
    {
        if(t<0)
            return 1;
        else
            return 0;
    }
};

int main()
{
Stack s;
cout<<"Enter 'a' to push, 'b' to pop, 'c' to peek & 'x' to exit the menu"<<endl;
char ch;
cin>>ch;
while(ch!='x')
{
switch(ch)
{
case 'a':
s.push();
break;
case 'b':
s.pop();
break;
case 'c':
s.peek();
break;
}
cout<<"Enter your choice"<<endl;
cin>>ch;
}

return 0;
}