-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack_operations.c
73 lines (60 loc) · 1.2 KB
/
stack_operations.c
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
#include<stdio.h>
#include<stdlib.h>
struct stack
{
int size;
int top;
int * arr;
// struct stack *arr;
};
int isEmpty(struct stack * ptr)
{
if (ptr->top == -1)
{
return 1; // this means TRUE
}
return 0; //this means FALSE
}
int isFull(struct stack *ptr){
if (ptr->top == (ptr->size - 1))
{
return 1;
}
return 0;
}
void push(struct stack *ptr, int val){
if (isFull(ptr))
{
printf("Stack Overflowed!!");
}
ptr->top++;
ptr->arr[ptr->top] = val;
}
int pop(struct stack *ptr){
if (isEmpty(ptr))
{
printf("Stack is Underflowed!!");
return -1;
}
int val = ptr->arr[ptr->top];
ptr->top--;
return val;
}
int main(){
struct stack * sp = (struct stack*)malloc(sizeof(struct stack));
sp->size = 10;
sp->top = -1;
sp->arr = (int *)malloc(sp->size * sizeof(int));
printf("%d\n", isFull(sp));
printf("%d\n", isEmpty(sp));
push(sp, 69);
push(sp, 420);
push(sp, 666);
printf("%d\n", sp->arr[sp->top]);
pop(sp);
pop(sp);
printf("%d\n", isFull(sp));
printf("%d\n", isEmpty(sp));
printf("%d\n", sp->arr[sp->top]);
return 0;
}