Data-Structure/stack_with_linked_list.cpp at master · KhanSaiful/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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include<bits/stdc++.h>

using namespace std;

struct Node {
    int data;
    struct Node* link;
};
struct Node* top;


void push(int data)
{
    struct Node* temp;
    temp = (struct Node*)malloc(sizeof(struct Node));

    if (!temp) {
        printf("\nHeap Overflow");
        exit(1);
    }


    temp->data = data;
    temp->link = top;
    top = temp;
}

int isEmpty()
{
    return top == NULL;
}

int peek()
{
    if (!isEmpty(top))
        return top->data;
    else
        exit(EXIT_FAILURE);
}


void pop()
{
    struct Node* temp;

    if (top == NULL) {
        printf("\nStack Underflow");
        exit(1);
    }
    else {
        temp = top;
        top = top->link;
        temp->link = NULL;
        free(temp);
    }
}

void display()
{
    struct Node* temp;

    if (top == NULL) {
        printf("\nStack Underflow");
        exit(1);
    }
    else {
        temp = top;
        while (temp != NULL) {

            printf("%d->", temp->data);
            temp = temp->link;
        }
    }
}


int main(void)
{

    push(11);
    push(22);
    push(33);
    push(44);

    display();

    printf("\nTop element is %d\n", peek());

    pop();
    pop();

    display();

    printf("\nTop element is %d\n", peek());
    return 0;
}