-
Notifications
You must be signed in to change notification settings - Fork 0
/
STACK.c.CPP
71 lines (70 loc) · 1.43 KB
/
STACK.c.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
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<limits.h>
#define SIZE 100
int stack[SIZE];
int top=-1;
void push(int element);
int pop();
int main()
{
int choice , data;
while(1)
{
printf("--------------\n");
printf("stack implmention program\n");
printf("1. push\n");
printf("2. pop\n");
printf("3. size\n");
printf("4. exit\n");
printf("--------------\n");
printf("Enter your Choice :");
scanf("%d",&choice);
switch(choice)
{
case 1:
printf(" Enter data put into stack: ");
scanf("%d",&data);
push(data);
break;
case 2:
data=pop();
if(data!=INT_MIN)
printf("Data=> %d\n",data);
break;
case 3:
printf(" Stack Size : %d\n",top+1);
break;
case 4:
printf("Exiting from app\n");
exit(0);
break;
default:
printf("Invalid choice,please try again\n");
}
printf("\n\n");
}
return(0);
}
void push(int element)
{
if(top >= SIZE)
{
printf("Stack overflow,can not add more element\n");
return;
}
top++;
stack[top]=element;
printf("Data pushed to stack\n");
}
int pop()
{
if(top<0)
{
printf("Stack is emptuy\n");
return INT_MIN;
}
return stack[top--];
getch();
}