DataStructures/Stackusing_linkedlist.c at main · PawanKalyanV/DataStructures · 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
97
98
99
100
101
102

/* stack using linkedlist */

#include<stdio.h>
#include<stdlib.h>

struct car {
     char *name;
     char *segment;
     int milage;
     float power;
     struct car *next;
};

struct car *HEAD = NULL;


void traverse(void)
{
        struct car *s1 = NULL;

        s1 = HEAD;

        while (s1 != NULL) {
                printf("%s %s %d %f\n", s1->name, s1->segment, s1->milage, s1->power);
                s1 = s1->next;
        }

}


void add(struct car *newNode)
{

        struct car *s1 = NULL;


        s1 = HEAD;

        newNode->next = HEAD;

        HEAD = newNode;
}

void delete()
{
        struct car *s1 = NULL;

         s1 = HEAD;

        HEAD = HEAD->next;

        free(s1);
}


void main()
{
        struct car *s1 = NULL;

        s1 = (struct car *)malloc(sizeof(struct car));
        s1->name = "\nHonda city";
        s1->segment = "suv";
        s1->milage = 20;
        s1->power = 80;
        s1->next = NULL;
        add(s1);

        s1 = (struct car *)malloc(sizeof(struct car));
        s1->name = "\nTata nexon";
        s1->segment = "Hatch Back";
        s1->milage = 24;
        s1->power = 87;
        s1->next = NULL;
        add(s1);

        s1 = (struct car *)malloc(sizeof(struct car));
        s1->name = "\nmaruthi";
        s1->segment = "suv";
        s1->milage = 21;
        s1->power = 78;
        s1->next = NULL;
        add(s1);

        s1 = (struct car *)malloc(sizeof(struct car));
        s1->name = "\nBmw";
        s1->segment = "suv";
        s1->milage = 21;
        s1->power = 78;
        s1->next = NULL;
        add(s1);

        traverse();

        delete();

        traverse();

      //   delete();

     //   traverse();
}