problem-solving-resources/stack.c at main · tanim913/problem-solving-resources · 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
77
78
79
#include <stdio.h>
#define stack_max 100

typedef struct
{
    int top;
    int data [stack_max];

} Stack;

void push (Stack *s, int item)
{

    if(s -> top < stack_max)
    {

        s->data[s -> top] = item; ///initially s->top is 0
        s->top = s-> top +1;
    }
    else
    {
        printf("Stack is full\n");
    }
}

int pop(Stack *s)
{
    if(s-> top ==0)
    {
        printf("Stack is empty\n");
        return -1;
    }
    else
    {
        s->top = s-> top -1;
        return s->data[s->top];/// when new value is pushed old value would be replaced
    }

}

int main ()
{
    Stack my_stack;

    my_stack.top = 0;

    push(&my_stack, 50);
    printf("Top value %d\n", my_stack.top);

    push(&my_stack, 60);
    printf("Top value %d\n", my_stack.top);

    push(&my_stack, 70);
    printf("Top value %d\n", my_stack.top);

    push(&my_stack, 80);
    printf("Top value %d\n", my_stack.top);


    printf("%d\n",pop(&my_stack));
    printf("Top value %d\n", my_stack.top);

    printf("%d\n",pop(&my_stack));
    printf("Top value %d\n", my_stack.top);

    printf("%d\n",pop(&my_stack));
    printf("Top value %d\n", my_stack.top);

    printf("%d\n",pop(&my_stack));
    printf("Top value %d\n", my_stack.top);

    printf("%d\n",pop(&my_stack));
    printf("Top value %d\n", my_stack.top);

    return 0;


}