C Program to Search and insert in a singly Linked List

Linked List is a dynamic data structure whose length can be changed (increased or decreased) at run time. Linked list located at random memory location. To search and insert in a linked list, we use user defined function for search and insert a node in a linked list.

Contents

• 1. Code to search in a linked list.
• 2. Insert before searched value in a linked list.
• 3. Insert after searched value in a linked list.
• 4.Source code to Search and insert in a linked list.
• 5. Download source code.

C programming code to Search and insert in a singly Linked List:

You need to create a linked list before search or insert in a linked list.
Also Read: C Program to Create and display Linked List

1. Code to search in a Linked List:

int search() { int svalue,i=0; struct node *temp; printf("\n Search: "); scanf("%d",&svalue); temp=head; while(temp!=NULL) { i++; if(svalue==temp->data) { printf("\n Searched value %d found in the location of %d. ",svalue,i); return i; } temp=temp->next; } printf("\n Not found %d in Linked List.",svalue); return 0; }

2. Insert before searched value in a linked list:

void insert_before() { struct node *temp,*new_node; int i, position; position=search(); if(position==1) { new_node=(struct node *)malloc(sizeof(struct node)); printf("\n Enter the data:"); scanf("%d",&new_node->data); new_node->next=head; head=new_node; printf("\n Node succesfully inserted."); } else { temp=head; for(i=1; i<=position; i++) { if(i==position-1) { new_node=(struct node *)malloc(sizeof(struct node)); printf("\n Enter the data:"); scanf("%d",&new_node->data); new_node->next=temp->next; temp->next=new_node; printf("\n Node succesfully inserted."); } temp=temp->next; } } }

3. Insert after searched value in a linked list:

void insert_after() { struct node *temp,*new_node; int i, position; position=search(); temp=head; for(i=1; i<=position; i++) { if(i==position) { new_node=(struct node *)malloc(sizeof(struct node)); printf("\n Enter the data:"); scanf("%d",&new_node->data); if(temp==last) { new_node->next=NULL; last->next=new_node; last=new_node; } else { new_node->next=temp->next; temp->next=new_node; } printf("\n Node succesfully inserted."); } temp=temp->next; } }

4. Source Code to Create, Search, insert and display a Linked List:

//Code by ismail@programmer.net #include<stdio.h> #include<stdlib.h> #define Esc 27 struct node { int data; struct node *next; }*head=NULL,*last; void create_node(); int search(); void insert_before(); void insert_after(); void display(); //------------------------------------------------- int main() { struct node *temp; int i; char ch; while(1) { printf("\n\n <@> Main Menu <@>\n"); printf(" ******************\n"); printf("\n\t1.Create Node\n\t2.Seacrh Node\n\t3.Insert node before searched value\n\t4.Insert node after searched value\n\t5.Display.\n\tPress ESC to Exit\n"); printf("\n Please choose, what kind of work you want to do?"); ch=getch(); switch(ch) { case '1': create_node(); break; case '2': search(); break; case '3': insert_before(); break; case '4': insert_after(); break; case '5': display(); break; case Esc: exit(1); default: printf("\n\n Invalid Input/ choice."); } } return 0; } //------------------------------------------------- void create_node() { struct node *new_node; char ch; do { new_node=(struct node *)malloc(sizeof(struct node)); printf("\n Enter the data:"); scanf("%d",&new_node->data); new_node->next=NULL; if(head==NULL) { head=new_node; last=new_node; } else { last->next=new_node; last=new_node; } printf("\n To create again press any key, if not press Space.\n"); ch=getch(); } while(ch!=32); } //------------------------------------------ int search() { int svalue,i=0; struct node *temp; printf("\n Search: "); scanf("%d",&svalue); temp=head; while(temp!=NULL) { i++; if(svalue==temp->data) { printf("\n Searched value %d found in the location of %d. ",svalue,i); return i; } temp=temp->next; } printf("\n Not found %d in Linked List.",svalue); return 0; } //--------------------------------------------- void insert_before() { struct node *temp,*new_node; int i, position; position=search(); if(position==1) { new_node=(struct node *)malloc(sizeof(struct node)); printf("\n Enter the data:"); scanf("%d",&new_node->data); new_node->next=head; head=new_node; printf("\n Node succesfully inserted."); } else { temp=head; for(i=1; i<=position; i++) { if(i==position-1) { new_node=(struct node *)malloc(sizeof(struct node)); printf("\n Enter the data:"); scanf("%d",&new_node->data); new_node->next=temp->next; temp->next=new_node; printf("\n Node succesfully inserted."); } temp=temp->next; } } } //----------------------------------------- void insert_after() { struct node *temp,*new_node; int i, position; position=search(); temp=head; for(i=1; i<=position; i++) { if(i==position) { new_node=(struct node *)malloc(sizeof(struct node)); printf("\n Enter the data:"); scanf("%d",&new_node->data); if(temp==last) { new_node->next=NULL; last->next=new_node; last=new_node; } else { new_node->next=temp->next; temp->next=new_node; } printf("\n Node succesfully inserted."); } temp=temp->next; } } //-------------------------------------------- void display() { struct node *temp; if(head==NULL) printf("\n\n Linked List is empty."); else { printf("\n\t Linked List:\n\t-------------\n\n"); temp=head; while(temp!=NULL) { printf("\t=>\t%d\n",temp->data); temp=temp->next; } } }

4. Download Source Code for Linke List

Download source code to Create, Search, Insert and Display a singly Linked List from below link:
Download source code to Create, Search, insert and Display a linked list

Try this code, i am sure you will be able to Search and insert in a singly Linked List. If you have any problems about this code, then write your problems in below, we will try to solve your problems. Don’t go in a hurry, if you enjoyed this article, please subscribe to feeds and drop a comment to show your thought.