forked from gcetOpenSourceSociety/Helloworld
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSTACK.CPP
107 lines (88 loc) · 1.34 KB
/
STACK.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
#include<stdio.h>
#include<process.h>
#include<conio.h>
void pop();
void push();
void peek();
void display();
int max=5;
int top=-1,stack[5];
int main()
{
printf("\n Stack Menu \n");
printf("\n1.Push \n2.Pop \n3.Disply \n4.peek \n5.Exit");
int ch;
while(1)
{
printf("\nEnter your choice(1-4):");
scanf("%d",&ch);
switch (ch)
{
case 1:push();
break;
case 2:pop();
break;
case 3:display();
break;
case 4:peek();
break;
case 5:
exit(0);
break;
default: printf("\n Wrong choice");
break;
}
}
return 0;
getch();
}
void push(){
int val;
if(top==max-1)
{
printf("\nStack is full");
}
else
{
printf("\nEnter a value you want to insert in stack:\n");
scanf("%d",&val);
top++;
stack[top]=val;
}
}
void pop(){
if(top==-1)
{
printf("\nStack is empty\n");
}
else
{
printf("Deleted element is %d",stack[top]);
top--;
}
}
void peek(){
int i;
if(top==-1)
{
printf("\nStack is empty\n");
}
else
{
printf("%d",stack[top]);
}
}
void display(){
int i;
if(top==-1)
{
printf("\nStack is empty\n");
}
else
{ printf("\nElements of Stack:\n");
for(i=top;i>=0;i--)
{
printf("%d\n",stack[i]);
}
}
}