DataStructures/Double_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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163

/* double linkedlist */

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

struct node{

	char *name;
        char *segment;

	struct node *prev;

	struct node *next;


};

struct node *HEAD = NULL;

struct node *TAIL = NULL;


void append(struct node *new)
{

	struct node *s1;

	struct node *temp;

	s1 = (struct node*)malloc(sizeof(struct node));

        s1->prev = NULL;

	s1->next = NULL;

	if(HEAD == NULL){

		HEAD = s1;
	}
	else{
		temp = s1;

		while(temp->next != NULL){

			temp = temp->next;
		}

		temp->next = s1;
		s1->prev = temp;
	}
}

void forward_traverse()
{
	struct node *s1 ;

	s1 = HEAD;

       while(s1 != NULL){

	       printf("%s %s",s1->name,s1->segment);

	       s1 = s1->next;

       }
}


void reverse_traverse()
{
       struct node *s1 ;

       s1 = TAIL;

       while(s1 != NULL){

               printf("%s %s",s1->name,s1->segment);

               s1 = s1->prev;
       }
}


void add(struct node *newNode,int pos)
{

        struct node *s1 = NULL;

        struct node *prev = s1;

        prev = HEAD;

        s1 = HEAD;

        for (int i=1; i<pos; i++) {
                prev = s1;
                s1 = s1->next;
        }
        prev->next = newNode;
        newNode->next = s1;

	newNode->prev = prev;
	s1->prev = newNode;

}

void delete(int pos)
{
        struct node *s1 = NULL;

        struct node *prev;

        prev = HEAD;

        s1 = HEAD;

        for(int i=1; i<pos; i++) {
                prev = s1;
                s1 = s1->next;
        }
        prev->next = s1->next;
        free(s1);
}


int main()
{
        struct node *s1 = NULL;
        s1 = (struct node *)malloc(sizeof(struct node));
        s1->name = "Honda city";
        s1->segment = "suv";

        append(s1);

        s1 = (struct node *)malloc(sizeof(struct node));
        s1->name = "Tata nexon";
        s1->segment = "Hatch Back";

        append(s1);

        s1 = (struct node *)malloc(sizeof(struct node));
        s1->name = "maruthi";
        s1->segment = "suv";

        append(s1);

        s1 = (struct node *)malloc(sizeof(struct node));
        s1->name = "kia";
        s1->segment = "suv";

        append(s1);


        add(s1,2);

	delete(3);

	forward_traverse();

	reverse_traverse();

}