Circular Doubly Linked List

Circular Doubly Linked List

CODE

👇

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

👉Execute👈

//Output

 /*

How Many Nodes you want to enter ?

5

 Enter the node data: 8

 Enter the node data: 1

 Enter the node data: 5

 Enter the node data: 6

 Enter the node data: 4

8--->1--->5--->6--->4--->

Operation on Doubly Linked List:

1. Insert:

2. Display

3. Search

4. Delete by position

5. Delete by value

6. Exit

 Enter your choice:1

 Enter the node data:9

Enter the node position to insert node:2

8--->9--->1--->5--->6--->4--->

Operation on Doubly Linked List:

1. Insert:

2. Display

3. Search

4. Delete by position

5. Delete by value

6. Exit

 Enter your choice:2

>>Circular Doubly Linked List<<

8--->9--->1--->5--->6--->4--->

Operation on Doubly Linked List:

1. Insert:

2. Display

3. Search

4. Delete by position

5. Delete by value

6. Exit

 Enter your choice:3

Enter Element to search: 1

1 is found 

8--->9--->1--->5--->6--->4--->

Operation on Doubly Linked List:

1. Insert:

2. Display

3. Search

4. Delete by position

5. Delete by value

6. Exit

 Enter your choice:4

Enter node position to be delete that node: 4

8--->9--->1--->6--->4--->

Operation on Doubly Linked List:

1. Insert:

2. Display

3. Search

4. Delete by position

5. Delete by value

6. Exit

 Enter your choice:5

Enter node data to be delete : 1

8--->9--->6--->4--->

Operation on Doubly Linked List:

1. Insert:

2. Display

3. Search

4. Delete by position

5. Delete by value

6. Exit

 Enter your choice:6

End

*/

                                                                                                                     //ThE ProFessoR