Skip to main content

Singly Linked List

Image
By ThE ProFessoR
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;

  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. void main ()
  18. {
  19. NODE*list=NULL, *temp;
  20.        int ch,n,pos;
  21. list=createlist (list);
  22. Display (list);

  24. search (list);

  26. list=insertbeg (list);
  27. Display (list);
  29. list=insertbetween (list);
  30. Display (list);

  32. list=insertlast (list);
  33. Display (list);

  35. list=Delpos (list);
  36. Display (list);

  38. list=Delvalue (list);
  39. Display (list);
  40. }

  42. NODE* createlist (NODE *list)
  43. {
  44.  int n,count;
  45. NODE *temp, *newnode;
  46.  printf ("How many nodes you want to enter ? \n");
  47.  scanf("%d" ,&n);
  48.  for(count=1 ; count<=n; count++)
  49.   {
  50.   newnode=(NODE*)malloc(sizeof(NODE));
  51.  newnode->next=NULL;
  52.   printf( "Enter the node data:-  " );
  53. scanf ("%d",&newnode->info);
  54.  if (list==NULL)
  55.   {
  56.     list=temp=newnode;
  57.    }
  58.   else 
  59.  { 
  60.    temp->next=newnode;
  61.    temp=newnode;
  62.   }
  63. }
  64.   return list;
  65. }
  66.   void Display (NODE *list)
  67.  {
  68.   NODE *temp=list;
  69.    while(temp!=NULL)
  70.   {
  71.      printf ("%d",temp->info);
  72.      printf("-->");
  73.     temp=temp->next ;
  74.  }
  75.    printf("NULL \n");
  76. }

  78. NODE * insertbeg(NODE *list)
  79. {
  80. int n;
  81. printf("Enter the node you want to insertat first position:");
  82. scanf("%d", &n);
  83. NODE *newnode;
  84. newnode=(NODE*)malloc(sizeof(NODE));
  85. newnode->info=n;
  86. newnode->next=list;
  87. list=newnode;
  88. return list;
  89. }

  91. NODE * insertbetween(NODE *list)
  92. {
  93. NODE *newnode, *temp=list;
  94. int n,i,pos;
  95. printf("Enter the  node data and position you want to insert between the node: \t");
  96. scanf("\n%d", &n);
  97. scanf("\n%d", &pos);
  98. newnode=(NODE*)malloc(sizeof(NODE));
  99. newnode->next=NULL;
  100. newnode->info=n;

  102. for(i=1; i<pos-1&&temp->next!=NULL; i++)
  103. temp=temp->next;
  104. newnode->next=temp->next;
  105. temp->next=newnode;

  107. return list;
  108. }

  110. NODE * insertlast(NODE *list)
  111. {
  112. int n;
  113. printf("Enter the  node data you want to insert at last position: \t");
  114. scanf("%d", &n);
  115. NODE *newnode, *temp;
  116. newnode=(NODE*)malloc(sizeof(NODE));
  117. newnode->info=n;
  118. newnode->next=NULL;

  120. for(temp=list; temp->next!=NULL; temp=temp->next);

  122. temp->next=newnode;
  123. return list;
  124. }

  126. void search (NODE *list)
  127. {
  128. int num, flag=0;
  129. NODE *temp;
  130. printf("Enter the element to be search:");
  131. scanf("%d", &num);
  133. for(temp=list; temp!=NULL; temp=temp->next)
  134. {
  135. if(temp->info==num)
  136. {
  137. printf(">>%d is Found<<\n",num);
  138. flag=1;
  139. exit;
  140. }
  141. }
  142. if(flag==0)
  143. printf(">>%d is not found<<\n", num);
  144. }

  146. NODE * Delpos(NODE *list)
  147. {
  148. NODE *temp=list, *temp1;
  149. int i, pos;
  150. printf("Enter node position to delete the node: \t");
  151. scanf("%d", &pos);
  152. if(pos==1)
  153. {
  154. list=temp->next;
  155. free (temp);
  156. return list;
  157. }
  158. for(i=1, temp=list; i<=pos-1 && temp!=NULL; i++)
  159. temp=temp->next;
  160. if(temp==NULL)
  161. {
  162. printf(">>position is out of range<<");
  163. return list;
  164. }
  165. temp1=temp->next;
  166. temp->next=temp1->next;
  167. free (temp1);
  168. return list;
  169. }

  171. NODE* Delvalue(NODE *list)
  172. {
  173. NODE *temp=list, *temp1;
  174. int num;
  175. printf("Enter node data to delete that node \t");
  176. scanf("%d", &num);
  177. if(list->info==num)
  178. {
  179. list=list->next;
  180. free (temp);
  181. return list;
  182. exit;
  183. }
  184. for(temp=list; temp->next!=NULL; temp=temp->next)
  185. if(temp->next->info==num)
  186. {
  187. temp1=temp->next;
  188. temp->next=temp1->next;
  189. free (temp1);
  190. return list;
  191. exit;
  192. }
  193. printf(">>Element is not found<<\n");
  194. return list;
  195. }


👉Execute👈


//Output
/*
How many nodes you want to enter ? 
5

Enter the node data:-  9
Enter the node data:-  1
Enter the node data:-  4
Enter the node data:-  2
Enter the node data:-  3
9-->1-->4-->2-->3-->NULL 

Enter the element to be search:5
>>5 is not found<<

Enter the node you want to insertat first position:7
7-->9-->1-->4-->2-->3-->NULL 

Enter the  node data and position you want to insert between the node: 5 4
7-->9-->1-->5-->4-->2-->3-->NULL 

Enter the  node data you want to insert at last position: 8
7-->9-->1-->5-->4-->2-->3-->8-->NULL 

Enter node position to delete the node: 2
7-->9-->5-->4-->2-->3-->8-->NULL 

Enter node data to delete that node 3
7-->9-->5-->4-->2-->8-->NULL 

*/



  •  

                                                               //ThE ProFessoR

Comments

Post a Comment