{"id":26848,"date":"2017-12-24T15:55:16","date_gmt":"2017-12-24T10:25:16","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26848"},"modified":"2017-12-24T15:55:16","modified_gmt":"2017-12-24T10:25:16","slug":"c-algorithm-delete-linked-list-node-given-position","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-algorithm-delete-linked-list-node-given-position\/","title":{"rendered":"Cpp Algorithm – Delete a Linked List node at a given position"},"content":{"rendered":"

Given a singly linked list and a position, delete a linked list node at the given position.<\/span><\/p>\n

Example:<\/strong><\/p>\n

Input: position = 1, Linked List = 8->2->3->1->7\r\nOutput: Linked List =  8->3->1->7\r\n\r\nInput: position = 0, Linked List = 8->2->3->1->7\r\nOutput: Linked List = 2->3->1->7<\/pre>\n
If node to be deleted is root, simply delete it. To delete a middle node, we must have pointer to the node previous to the node to be deleted. So if positions is not zero, we run a loop position-1 times and get pointer to the previous node.<\/p>\n
C++ Programming:<\/strong><\/p>\n
 
 <\/div> 
\/\/ A complete working C program to delete a node in a linked list\/\/ at a given position#include <stdio.h>#include <stdlib.h> \/\/ A linked list nodestruct node{    int data;    struct node *next;}; \/* Given a reference (pointer to pointer) to the head of a list   and an int, inserts a new node on the front of the list. *\/void push(struct node** head_ref, int new_data){    struct node* new_node = (struct node*) malloc(sizeof(struct node));    new_node->data  = new_data;    new_node->next = (*head_ref);    (*head_ref)    = new_node;} \/* Given a reference (pointer to pointer) to the head of a list   and a position, deletes the node at the given position *\/void deleteNode(struct node **head_ref, int position){   \/\/ If linked list is empty   if (*head_ref == NULL)      return;    \/\/ Store head node   struct node* temp = *head_ref;     \/\/ If head needs to be removed    if (position == 0)    {        *head_ref = temp->next;   \/\/ Change head        free(temp);               \/\/ free old head        return;    }     \/\/ Find previous node of the node to be deleted    for (int i=0; temp!=NULL && i<position-1; i++)         temp = temp->next;     \/\/ If position is more than number of ndoes    if (temp == NULL || temp->next == NULL)         return;     \/\/ Node temp->next is the node to be deleted    \/\/ Store pointer to the next of node to be deleted    struct node *next = temp->next->next;     \/\/ Unlink the node from linked list    free(temp->next);  \/\/ Free memory     temp->next = next;  \/\/ Unlink the deleted node from list} \/\/ This function prints contents of linked list starting from\/\/ the given nodevoid printList(struct node *node){    while (node != NULL)    {        printf(" %d ", node->data);        node = node->next;    }} \/* Drier program to test above functions*\/int main(){    \/* Start with the empty list *\/    struct node* head = NULL;     push(&head, 7);    push(&head, 1);    push(&head, 3);    push(&head, 2);    push(&head, 8);     puts("Created Linked List: ");    printList(head);    deleteNode(&head, 4);    puts("\\nLinked List after Deletion at position 4: ");    printList(head);    return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
Created Linked List: \r\n 8  2  3  1  7 \r\nLinked List after Deletion at position 4: \r\n 8  2  3  1<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
Cpp Algorithm – Delete a Linked List node at a given position – Linked List – Given a singly linked list and a position, delete a linked list<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[83515,1,79476,79478],"tags":[83607,83605,83609,83608,83604,83606,83716,83610,83711,83712,83715,83713,83697,83714,79919,79923],"class_list":["post-26848","post","type-post","status-publish","format-standard","hentry","category-c-programming-3","category-coding","category-linked-list","category-singly-linked-list","tag-algorithm-c-definition","tag-algorithm-c-example","tag-c-algorithm-book","tag-c-algorithm-pdf","tag-c-algorithm-sort","tag-c-algorithm-tutorial","tag-c-stl-algorithm-cheat-sheet","tag-c-stl-algorithm-tutorial","tag-delete-node-at-given-position-in-a-linked-list-in-c","tag-delete-node-at-given-position-in-a-linked-list-java","tag-delete-node-at-given-position-in-a-singly-linked-list","tag-delete-node-from-singly-linked-list-in-c","tag-delete-nth-node-in-linked-list-c","tag-delete-nth-position-in-linked-list-using-c","tag-delete-specific-node-in-linked-list","tag-write-a-program-to-delete-a-node-from-linked-list-in-c"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26848","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26848"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26848\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26848"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26848"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26848"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}