Doubly Linked List

Doubly Linked List

CODE

👇

1. include <stdio.h>
2. #include <stdlib.h>
3. typedef struct node
4. {
5. int info;
6. struct node *prev, *next;
7. }NODE;
8. 
   
9. NODE* createlist(NODE *list);
10. NODE* insert(NODE *list, int num, int pos);
11. void display(NODE *list);
12. NODE* search(NODE *list, int n1);
13. NODE* delpos(NODE *list, int pos);
14. NODE* delvalue(NODE *list, int n2);
15. 
    
16. void main()
17. {
18. int num, n1, n2, n3, pos;
19. NODE *list=NULL, *temp;
20. list=createlist(list);
21. display(list);
22. 
    
23. printf("\nEnter Element to be search:\t");
24. scanf("%d", &n1);
25. temp=search(list, n1);
26. if(temp!=NULL)
27. printf(">>'%d' is found<<\n",n1);
28. else
29. printf(">>'%d' is not found<<\n",n1);
30. 
    
31. printf("\nEnter the node data to insert node:\t");
32. scanf("%d", &num);
33. printf("Enter the node position to insert node:\t");
34. scanf("%d", &pos);
35. list=insert(list,num,pos);
36. display(list);
37. 
    
38. printf("\nEnter node postion to delete that node:\t");
39. scanf("%d", &pos);
40. list=delpos(list, pos);
41. display (list);
42. 
    
43. printf("\nEnter node data to delete node:\t");
44. scanf("%d", &n2);
45. list=delvalue(list, n2);
46. display(list);
47. }
48. 
    
49. NODE* createlist(NODE *list)
50. {
51. int n, count;
52. NODE *temp, *newnode;
53. printf("How many nodes you want to enter? \n");
54. scanf("%d", &n);
55. for(count=1; count<=n; count++)
56. {
57. newnode=(NODE*)malloc(sizeof(NODE));
58. newnode->prev=newnode->next=NULL;
59. printf("Enter the node data:\t");
60. scanf("%d", &newnode->info);
61. if(list==NULL)
62. {
63. list=temp=newnode;
64. }
65. else
66. {
67. temp->next=newnode;
68. newnode->prev=temp;
69. temp=newnode;
70. }
71. }
72. return list;
73. }
74. 
    
75. NODE* insert(NODE *list, int num, int pos)
76. {
77. NODE *newnode, *temp;
78. int i;
79. newnode=(NODE*)malloc(sizeof(NODE));
80. newnode->prev=newnode->next=NULL;
81. newnode->info=num;
82. if(pos==1)
83. {
84. newnode->next=list;
85. list->prev=newnode;
86. list=newnode;
87. return list;
88. }
89. for(i=1,temp=list; i<pos-1 && temp!=NULL; i++)
90. temp=temp->next;
91. if(temp==NULL)
92. {
93. printf(">>position is out of range<< \n");
94. return list;
95. }
96. else
97. if(temp->next==NULL)
98. {
99. newnode->next=temp->next;
100. newnode->prev=temp;
101. temp->next=newnode;
102. return list;
103. }
104. else
105. {
106. newnode->next=temp->next;
107. temp->next->prev=newnode;
108. temp->next=newnode;
109. newnode->prev=temp;
110. return list;
111. }
112. }
113. 
     
114. void display(NODE *list)
115. {
116. NODE *temp=list;
117. for(temp=list; temp!=NULL; temp=temp->next)
118. {
119. printf("%d", temp->info);
120. printf("--->>");
121. }
122. printf("NULL \n");
123. }
124. 
     
125. NODE* search(NODE *list, int n1)
126. {
127. NODE *temp=list;
128. for(temp=list; temp!=NULL; temp=temp->next)
129. if(temp->info==n1)
130. return temp;
131. return NULL;
132. }
133. 
     
134. NODE* delpos(NODE *list, int pos)
135. {
136. NODE *temp=list, *temp1, *temp2;
137. int i;
138. if(pos==1)
139. {
140. list=list->next;
141. list->prev=NULL;
142. free (temp);
143. return list;
144. exit;
145. }
146. for(i=1,temp=list; i<pos-1 && temp!=NULL; i++)
147. temp=temp->next;
148. if(temp==NULL || temp->next==NULL)
149. {
150. printf(">>position out of range<< \n");
151. return list;
152. exit;
153. }
154. temp1=temp->next;
155. if(temp1->next==NULL)
156. {
157. temp->next=NULL;
158. free (temp1);
159. return list;
160. exit;
161. }
162. else
163. {
164. temp2=temp1->next;
165. temp2->prev=temp;
166. temp->next=temp2;
167. free (temp1);
168. return list;
169. exit;
170. }
171. }
172. 
     
173. NODE* delvalue(NODE *list, int n2)
174. {
175. NODE *temp=list, *temp1, *temp2;
176. if(list->info==n2)
177. {
178. list=list->next;
179. free (temp);
180. return list;
181. exit;
182. }
183. for(temp=list; temp->next!=NULL; temp=temp->next)
184. {
185. if(temp->next->info==n2)
186. {
187. temp1=temp->next;
188. if(temp1->next==NULL)
189. {
190. temp->next=NULL;
191. free (temp1);
192. return list;
193. exit;
194. }
195. else
196. {
197. temp2=temp1->next;
198. temp->next=temp2;
199. temp2->prev=temp;
200. free (temp1);
201. return list;
202. exit;
203. }
204. }
205. }
206. printf(">>Enter valid data<< \n");
207. return list;
208. }

👉Execute👈

//Output

/*

How many nodes you want to enter? 

5

Enter the node data: 33

Enter the node data: 64

Enter the node data: 78

Enter the node data: 13

Enter the node data: 57

33--->>64--->>78--->>13--->>57--->>NULL 

Enter Element to be search: 64

>>'64' is found<<

Enter the node data to insert node: 87

Enter the node position to insert node: 4

33--->>64--->>78--->>87--->>13--->>57--->>NULL 

Enter node postion to delete that node: 5

33--->>64--->>78--->>87--->>57--->>NULL 

Enter node data to delete node: 78

33--->>64--->>87--->>57--->>NULL 

*/

                                                                //ThE ProFessoR