Data-Structures-and-Algorithm/Stack_Array.cpp at master · Adrish1999/Data-Structures-and-Algorithm · 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
#include<stdio.h>
#defineMAX50

int stack[MAX],top=-1;

voidpush(int v)
{
if(top==MAX-1)
	{
printf("Stack Overflow\n");
return;
	}
	stack[++top]=v;
}
voidpop()
{
if(top==-1)
	{
printf("Stack Underflow\n");
return;
	}
printf("Deleted item is %d\n",stack[top]);
	top--;
}
voiddisplay()
{
if(top==-1)
	{
printf("Stack is empty\n");
return;
	}
printf("The stack elements are \n");
int i;
for(i=top;i>=0;i--)
printf("%d ",stack[i]);
printf("\n");
}
intmain()
{
int n,ch;
while(1)
	{
printf("Enter 1/2/3/4 to push/pop/display/exit\n");
scanf("%d",&ch);
switch(ch)
 {
case1:
printf("Enter data\n");
scanf("%d",&n);
push(n);
break;
case2:
pop();
break;
case3:
display();
break;
case4:
return0;
break;
default:printf("Wrong choice plz enter again\n");
 }

	}
}