Menu Driven Singly Linked List

Menu Driven Singly Linked List

 CODE

👇

1. #include<stdio.h>
2. #include<stdlib.h>
3. typedef struct node 
4. {
5. int info;
6. struct node *next;
7. }NODE;
8. 
   
9. NODE* createlist(NODE *list); 
10. void Display (NODE *list);
11. void search (NODE *list);
12. NODE* insertbeg(NODE *list);
13. NODE* insertbetween(NODE *list);
14. NODE* insertlast(NODE *list);
15. NODE* Delpos(NODE *list);
16. NODE* Delvalue(NODE *list);
17. 
    
18. //MAIN FUNCTION
19. void main ()
20. {
21.     printf(">>Singly Linked List<<");
22. NODE*list=NULL, *temp;
23.     int ch,n,pos;
24. do
25. {
26. printf("\n1. Create:");
27. printf("\n2. Display");
28. printf("\n3.Insert AtFirst");
29. printf("\n4.Insert AtMiddle");
30. printf("\n5.Insert AtLast");
31. printf("\n6. Delete by position");
32. printf("\n7. Delete by value");
33. printf("\n8. Search");
34. printf("\n9.Reverse");
35. printf("\n10.Count");
36. printf("\n11. Exit\n");
37. printf("\n Enter your choice:");
38. scanf("%d", &ch);
39. switch(ch)
40. {
41. case 1:
42. list=createlist (list);
43. break;
44. case 2:
45. Display (list);
46. break;
47. case 3:
48. list=insertbeg (list);
49. break;
50. case 4:
51. list=insertbetween (list);
52. break;
53. case 5:
54. list=insertlast (list);
55. break;
56. case 6:
57. break;
58. case 7:
59. break;
60. case 8:search (list);
61. break;
62. case 9:
63. break;
64. case 10:
65. break;
66. case 11:printf("_END_");
67. break;
68. } 
69. }while(ch != 11);
70. }
71. 
    
72. 
    
73. //CREATE FUNCTION
74. NODE* createlist (NODE *list)
75. {
76.  int n,count;
77. NODE *temp, *newnode;
78.  printf ("\nHow many nodes you want to enter ? \n");
79.  scanf("%d" ,&n);
80.  for(count=1 ; count<=n; count++)
81.   {
82.   newnode=(NODE*)malloc(sizeof(NODE));
83.  newnode->next=NULL;
84.   printf( "Enter the node data:-  " );
85. scanf ("%d",&newnode->info);
86.  if (list==NULL)
87.   {
88.     list=temp=newnode;
89.    }
90.   else 
91.  { 
92.    temp->next=newnode;
93.    temp=newnode;
94.   }
95. }
96.   return list;
97. }
98.   void Display (NODE *list)
99.  {
100.   NODE *temp=list;
101.    while(temp!=NULL)
102.   {
103.      printf ("%d",temp->info);
104.      printf("-->");
105.     temp=temp->next ;
106.  }
107.    printf("NULL \n");
108. }
109. 
     
110. 
     
111. //Insert AT BEGINING
112. NODE * insertbeg(NODE *list)
113. {
114. int n;
115. printf("Enter the node you want to insert at first position:");
116. scanf("%d", &n);
117. NODE *newnode;
118. newnode=(NODE*)malloc(sizeof(NODE));
119. newnode->info=n;
120. newnode->next=list;
121. list=newnode;
122. return list;
123. }
124. 
     
125. //INSERT IN BETWEEN
126. NODE * insertbetween(NODE *list)
127. {
128. NODE *newnode, *temp=list;
129. int n,i,pos;
130. printf("Enter the  node data and position you want to insert between the node: \t");
131. scanf("\n%d", &n);
132. scanf("\n%d", &pos);
133. newnode=(NODE*)malloc(sizeof(NODE));
134. newnode->next=NULL;
135. newnode->info=n;
136. 
     
137. for(i=1; i<pos-1&&temp->next!=NULL; i++)
138. temp=temp->next;
139. newnode->next=temp->next;
140. temp->next=newnode;
141. 
     
142. return list;
143. }
144. 
     
145. 
     
146. //INSERT AT LAST
147. NODE * insertlast(NODE *list)
148. {
149. int n;
150. printf("Enter the  node data you want to insert at last position: \t");
151. scanf("%d", &n);
152. NODE *newnode, *temp;
153. newnode=(NODE*)malloc(sizeof(NODE));
154. newnode->info=n;
155. newnode->next=NULL;
156. 
     
157. for(temp=list; temp->next!=NULL; temp=temp->next);
158. 
     
159. temp->next=newnode;
160. return list;
161. }
162. 
     
163. 
     
164. //SEARCH
165. void search (NODE *list)
166. {
167. int num, flag=0;
168. NODE *temp;
169. printf("Enter the element to be search:");
170. scanf("%d", &num);
171. for(temp=list; temp!=NULL; temp=temp->next)
172. {
173. if(temp->info==num)
174. {
175. printf(">>%d is Found<<\n",num);
176. flag=1;
177. exit;
178. }
179. }
180. if(flag==0)
181. printf(">>%d is not found<<\n", num);
182. }
183. 
     
184. 
     
185. //DELETE BY POSITION
186. NODE * Delpos(NODE *list)
187. {
188. NODE *temp=list, *temp1;
189. int i, pos;
190. printf("Enter node position to delete the node: \t");
191. scanf("%d", &pos);
192. if(pos==1)
193. {
194. list=temp->next;
195. free (temp);
196. return list;
197. }
198. for(i=1, temp=list; i<=pos-1 && temp!=NULL; i++)
199. temp=temp->next;
200. if(temp==NULL)
201. {
202. printf(">>position is out of range<<");
203. return list;
204. }
205. temp1=temp->next;
206. temp->next=temp1->next;
207. free (temp1);
208. return list;
209. }
210. 
     
211. //DELETE BY VALUE
212. NODE* Delvalue(NODE *list)
213. {
214. NODE *temp=list, *temp1;
215. int num;
216. printf("Enter node data to delete that node \t");
217. scanf("%d", &num);
218. if(list->info==num)
219. {
220. list=list->next;
221. free (temp);
222. return list;
223. exit;
224. }
225. for(temp=list; temp->next!=NULL; temp=temp->next)
226. if(temp->next->info==num)
227. {
228. temp1=temp->next;
229. temp->next=temp1->next;
230. free (temp1);
231. return list;
232. exit;
233. }
234. printf(">>Element is not found<<\n");
235. return list;
236. }