data-structure/stack.c at master · hackTheFest/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
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<process.h>

inta[5],top=0;
voidpush();
voidpop();
voiddisplay();
voidmain()
{
system("cls");
inti;
while(1)
 {
printf("\t1.Push\n2.Pop\n3.Display\n4.Exit\nEnter choise..\n");
scanf("%d",&i);
switch(i)
 {
case1:
push();
break;
case2:
pop();
break;
case3:
display();
break;
case4:
exit(0);
default:
printf("Invalid choise..\1");
 }
 }
getch();
}
voidpush()
{
if(top==5)
 {
printf("Stack overflow");
 }
else
 {
top++;
printf("Enter data : ");
scanf("%d",&a[top]);
printf("/nOperation successful..");
 }
};
voidpop()
{
if(top==0)
 {
printf("\nStack underflow");
 }
else
 {
printf("\n%d is successfully removed...",a[top]);
top--;
 }
};
voiddisplay()
{
if(top==0)
 {
printf("\nStack underflow");
 }
else
 {
for(intq=0;q<=top;q++)
 {
printf("\n%d",a[q]);
 }
 }
};