data-structure/Stack.cpp at main · ChauhanDiya/data-structure · 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
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
#include<iostream>
usingnamespacestd;

classStack{
private:
int *arr, top, size;
public:
Stack(){
 cout<<"\nEnter Maximum Size of Stack : ";
 cin>>size;
 arr=newint[size];
 top=-1;
int n;
 cout<<"\nEnter Number of Elements you want to enter : ";
do
 cin>>n;
while(n>size);
 cout<<"\nEnter Terms : ";
while(n--){
int a;
 cin>>a;
 top++;
 arr[top]=a;
 }
 }

voiddisplay(){
 cout<<"\nStack : ";
for(int i=top; i>-1; i--){
 cout<<arr[i]<<"";
 }
 cout<<endl;
 }

voidpush(int a){
if(top==size-1){
 cout<<"\nStack Overflow";
return;
 }
 top++;
 arr[top]=a;
 }

intpop(){
if(top==-1){
 cout<<"\nStack Underflow\n";
return -1;
 }
int a;
 a=arr[top];
 arr[top--]=0;
return a;
 }

intpeek(int pos){
if(pos<=top)
return arr[top-pos];
return -1;
 }

intstackTop(){
if(top==-1)
return -1;
return arr[top];
 }

boolisEmpty(){
if(top==-1)
returntrue;
returnfalse;
 }

boolisFull(){
if(top==size-1)
returntrue;
returnfalse;
 }

~Stack(){
delete []arr;
 arr=NULL;
 }
};

intmain(){
 cout<<"\nCreating a Stack"<<endl;
 Stack s;
 cout<<"\nMenu : ";
 cout<<"\n\t1.Display\n\t2.Push\n\t3.Pop\n\t4.Peek\n\t5.Get Top Element";
 cout<<"\n\t6.Check if Stack is Empty\n\t7.Check if Stack is Full\n\t0.Exit";
int opt;
do{
 cout<<"\nChoose Option : ";
 cin>>opt;
switch(opt){
case0:
break;
case1:
 s.display();
break;
case2:
int x;
 cout<<"\nEnter Element : ";
 cin>>x;
 s.push(x);
break;
case3:
 cout<<"\nRemoved Element : "<<s.pop();
break;
case4:
int pos;
 cout<<"\nEnter Position to peek at : ";
 cin>>pos;
 cout<<"\nElement at Position "<<pos<<" : "<<s.peek(pos);
break;
case5:
 cout<<"\nStack Top : "<<s.stackTop();
break;
case6:
 cout<<"Stack is Empty? "<<s.isEmpty();
break;
case7:
 cout<<"Stack is Full? "<<s.isFull();
break;
default:
 cout<<"\nInvalid Input";
 }
 }while(opt!=0);
return0;
}