C Program to search and delete in a singly Linked List

Delete a node in a singly linked list just like a person breaks away from a human chain then the two persons (between whom the person was) needs to join hand together to continue the chain. We use free keyword to delete a node from linked list, first finding the node by searching in the linked list and then calling free() on the pointer that containing its address.

Contents

• 1. How to delete a node from linked list.
2. C programming code to search and delete in a singly Linked List.
• 2.1. Code to search in a linked list.
• 2.2. Code to delete searched value in a linked list.
• 2.3. Source code to Search and delete node in a linked list.
• 3. Download source code to search and delete a node in a linked list.

1. How to delete a node from linked list:

If you wish to delete head (first) node from linked list, you need to assign 'head' node to a 'temp' node and changeing the head node with next node then calling free(temp) to delete the node. If you wish to delete tail (last) node from linked list, you need to assign 'tail' node to a 'temp' node and changeing the tail node with previous node then calling free(temp) to delete the node. If you wish to delete node is any node other than the head and tail node then you need to changing the 'next' pointer of the previous node with the address of the node that is just after the deleted node.
Also Read: C Program to Search and Insert in a singly Linked List

2. C programming code to search and delete in a singly Linked List:

You need to create a linked list before search or delete node in a linked list.To know, how to create and display node in a linked list, just follow the link which is given in below:
Also Read: C Program to Create and display Linked List

2.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.2. Delete searched value in a linked list:

void delete_node() { struct node *temp=head,*prev; int i,position=search(); if(position==0) printf("\n ERROR!!!(Node not found)"); else if(position==1) { head=temp->next; free(temp); printf("\n Head node successfully deleted."); } else { for(i=1; i<=position; i++) { if(i==position) { if(temp==last) { prev->next=NULL; last=prev; free(temp); printf("\n Tail Node succesfully deleted."); } else { prev->next=temp->next; free(temp); printf("\n Node succesfully deleted."); } } prev=temp; temp=temp->next; } } }

2.3. 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 delete_node(); 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.Delete node\n\t4.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': delete_node(); break; case '4': 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 delete_node() { struct node *temp=head,*prev; int i,position=search(); if(position==0) printf("\n ERROR!!!(Node not found)"); else if(position==1) { head=temp->next; free(temp); printf("\n Head node successfully deleted."); } else { for(i=1; i<=position; i++) { if(i==position) { if(temp==last) { prev->next=NULL; last=prev; free(temp); printf("\n Tail Node succesfully deleted."); } else { prev->next=temp->next; free(temp); printf("\n Node succesfully deleted."); } } prev=temp; 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; } } }

3. Download Source Code to search and delete node in a 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 delete searched value 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.