web_development/stackUsingLinkedList.c at master · Nishant197/web_development · 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
// Stack Using Linked List
#include<stdio.h>
#include<math.h>
#include "linkedList.h"

PUSH(struct node **TOP,int x)
{
    InsBeg(&(*TOP),x);
}
int POP(struct node **TOP)
{
    int x;
    if ((*TOP) == NULL)
    {
        printf("Stack Underflows");
        exit(1);
    }
    else
    {
       x = DelBeg(&(*TOP));
       return x;
    }
}
Empty(struct node **TOP)
{
    struct node *P = (*TOP);
    if ((*TOP)==NULL)
        return 1;
    else
        return 0;
}

int main()
{
    struct node *TOP;
    int x;
    TOP = NULL;
    PUSH(&TOP,100);
    PUSH(&TOP,200);
    PUSH(&TOP,300);
    PUSH(&TOP,400);
    PUSH(&TOP,500);
    PUSH(&TOP,600);
    Traverse(&TOP);
    x = POP(&TOP);
    printf("\nDeleted Item = %d",x);
    x = POP(&TOP);
    printf("\nDeleted Item = %d",x);
    x = POP(&TOP);
    printf("\nDeleted Item = %d",x);
    x = POP(&TOP);
    printf("\nDeleted Item = %d",x);
    x = POP(&TOP);
    printf("\nDeleted Item = %d",x);
    x = POP(&TOP);
    printf("\nDeleted Item = %d\n",x);
    x = POP(&TOP);
    return 0;
}