forked from Vatsalparsaniya/Data-Structure
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack_using_arrays.cpp
More file actions
78 lines (69 loc) · 1.03 KB
/
Copy pathStack_using_arrays.cpp
File metadata and controls
78 lines (69 loc) · 1.03 KB
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
#include<iostream>
void push();
void pop();
void dis();
int top=-1,ar[10],n=10;
void main()
{
int ch;
do{
cout<<"SELECT AN OPTION : \n\n";
cout<<"1. ENTER AN ELEMENT\n";
cout<<"2. DELETE AN ELEMENT\n";
cout<<"3. DISPLAY THE ELEMENTS\n";
cout<<"4. EXIT\n";
cin>>ch;
switch(ch)
{
case 1 : {push();
break;}
case 2 : {pop();
break;}
case 3 : {dis();
break;}
case 4 : break;
default : {cout<<"WRONG OPTION!!\n";
break;}
}
}while(ch!=4);
}
void push()
{
if(top >= n-1)
{
cout<<"Stack Overflow.\n";
}
else
{
top++;
cout<<"Enter the element : ";
cin>>ar[top];
}
}
void pop()
{
if(top <= -1)
{
cout<<"Stack Underflow.\n";
}
else
{
cout<<"Element deleted: "<<ar[top];
top--;
}
}
void dis()
{
if(top>=0)
{
cout<<"Elements are :\n";
for(int i=top;i>=0;i--)
{
cout<<ar[i]<<"\n";
}
}
else
{
cout<<"Stack is empty.\n";
}
}