Algorithm<\/h2>\n

<\/div>

Algorithm to delete node from any positionInput : head  {   Pointer to the first node of the list }last  {   Pointer to the last node of the list }N  {  Position to be deleted from list }Begin :    current \u2190 head;    For i \u2190 1 to N and current != NULL do        current \u2190 current.next;    End for    If (N == 1) then        deleteFromBeginning()    End if    Else if (current == last) then         deleteFromEnd()    End if    Else if (current != NULL) then        current.prev.next \u2190 current.next        If (current.next != NULL) then            current.next.prev \u2190 current.prev;        End if        unalloc (current)        write ('Node deleted successfully from ', N, ' position')    End if    Else then        write ('Invalid position')    End ifEnd<\/code><\/pre> <\/div>\n
Sample Code in C++<\/h2>\n
 
 <\/div> 
#include <bits\/stdc++.h>   using namespace std;   struct Node {     int data;     struct Node* next;     struct Node* prev; };   \/* Function to delete a node in a Doubly Linked List.    head_ref --> pointer to head node pointer.    del  -->  pointer to node to be deleted. *\/void deleteNode(struct Node** head_ref, struct Node* del) {        if (*head_ref == NULL || del == NULL)         return;       \/* If node to be deleted is head node *\/    if (*head_ref == del)         *head_ref = del->next;       \/* Change next only if node to be deleted is NOT         the last node *\/    if (del->next != NULL)         del->next->prev = del->prev;       \/* Change prev only if node to be deleted is NOT         the first node *\/    if (del->prev != NULL)         del->prev->next = del->next;       \/* Finally, free the memory occupied by del*\/    free(del); }   \/* Function to delete the node at the given position    in the doubly linked list *\/void deleteNodeAtGivenPos(struct Node** head_ref, int n) {     \/* if list in NULL or invalid position is given *\/    if (*head_ref == NULL || n <= 0)         return;       struct Node* current = *head_ref;     int i;       \/* traverse up to the node at position 'n' from        the beginning *\/    for (int i = 1; current != NULL && i < n; i++)         current = current->next;       \/* if 'n' is greater than the number of nodes        in the doubly linked list *\/    if (current == NULL)         return;       \/* delete the node pointed to by 'current' *\/    deleteNode(head_ref, current); }   \/* Function to insert a node at the beginning     of the Doubly Linked List *\/void push(struct Node** head_ref, int new_data) {     \/* allocate node *\/    struct Node* new_node =           (struct Node*)malloc(sizeof(struct Node));       \/* put in the data  *\/    new_node->data = new_data;       \/* since we are adding at the beginning,     prev is always NULL *\/    new_node->prev = NULL;       \/* link the old list off the new node *\/    new_node->next = (*head_ref);       \/* change prev of head node to new node *\/    if ((*head_ref) != NULL)         (*head_ref)->prev = new_node;       \/* move the head to point to the new node *\/    (*head_ref) = new_node; }   \/* Function to print nodes in a given doubly    linked list *\/void printList(struct Node* head) {     while (head != NULL) {         cout << head->data << " ";         head = head->next;     } }   \/* Driver program to test above functions*\/int main() {     \/* Start with the empty list *\/    struct Node* head = NULL;       \/* Create the doubly linked list 10<->8<->4<->2<->5 *\/    push(&head, 5);     push(&head, 2);     push(&head, 4);     push(&head, 8);     push(&head, 10);       cout << "Doubly linked list before deletion:n";     printList(head);       int n = 2;       \/* delete node at the given position 'n' *\/    deleteNodeAtGivenPos(&head, n);       cout << "\\nDoubly linked list after deletion:n";     printList(head);       return 0; } <\/code><\/pre> <\/div>\n
Output<\/h2>\n
 
 <\/div> 
Doubly linked list before deletion:10 8 4 2 5Doubly linked list after deletion:10 4 2 5<\/code><\/pre> <\/div>\n
\n
\n
Time Complexity<\/h2>\n<\/div>\n<\/div>\n
\n
\n
\n
O(n), in worst case where n is the number of nodes in the doubly linked list.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
Answer : In a single linked list, every node has link to its next node in the sequence…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"footnotes":""},"categories":[3028],"tags":[195,3293,971,491,221,368,203,199,214,198,363,3057,3297,3287,3290,3292,3289,3295,3294,3286,3310,205,3311,3301,3313,3316,3299,3308,3309,3306,3303,3304,3315,3302,3307,3314,3312,3305,222,15934,484,3054,196,212,3291,3300,207,366,204,3298,206,972,200,3055,197,968,3056,3296,3288,285,969],"class_list":["post-485","post","type-post","status-publish","format-standard","hentry","category-data-structure","tag-accenture-interview-questions-and-answers","tag-algorithm-for-insertion-and-deletion-in-doubly-linked-list","tag-altimetrik-india-pvt-ltd-interview-questions-and-answers","tag-applied-materials-interview-questions-and-answers","tag-bharti-airtel-interview-questions-and-answers","tag-bmc-software-interview-questions-and-answers","tag-capgemini-interview-questions-and-answers","tag-casting-networks-india-pvt-limited-interview-questions-and-answers","tag-cgi-group-inc-interview-questions-and-answers","tag-chetu-interview-questions-and-answers","tag-ciena-corporation-interview-questions-and-answers","tag-collabera-te-interview-questions-and-answers","tag-delete-a-node-from-linked-list-in-c","tag-delete-all-nodes-in-doubly-linked-list","tag-delete-all-nodes-in-doubly-linked-list-c","tag-delete-at-position-in-a-doubly-linked-list","tag-delete-last-node-in-doubly-linked-list-in-c","tag-delete-last-node-in-doubly-linked-list-java","tag-delete-node-from-doubly-linked-list-c","tag-delete-node-from-doubly-linked-list-java","tag-deletion-in-doubly-linked-list","tag-dell-international-services-india-pvt-ltd-interview-questions-and-answers","tag-doubly-circular-linked-list-in-data-structure","tag-doubly-linked-list","tag-doubly-linked-list-c-code","tag-doubly-linked-list-deletion","tag-doubly-linked-list-deletion-program-in-cm","tag-doubly-linked-list-example","tag-doubly-linked-list-implementation","tag-doubly-linked-list-implementation-in-c","tag-doubly-linked-list-in-c","tag-doubly-linked-list-in-data-structure","tag-doubly-linked-list-insertion-and-deletion","tag-doubly-linked-list-java","tag-doubly-linked-list-operations","tag-doubly-linked-list-program-in-c","tag-doubly-linked-list-program-in-data-structure","tag-doubly-linked-list-program-in-data-structure-using-c","tag-flipkart-interview-questions-and-answers","tag-geekyants-interview-questions-and-answers","tag-genpact-interview-questions-and-answers","tag-globallogic-india-pvt-ltd-interview-questions-and-answers","tag-ibm-interview-questions-and-answers","tag-indecomm-global-services-interview-questions-and-answers","tag-insertion-and-deletion-in-doubly-linked-list-in-c","tag-lete-a-node-from-doubly-linked-list","tag-mphasis-interview-questions-and-answers","tag-netapp-interview-questions-and-answers","tag-oracle-corporation-interview-questions-and-answers","tag-remove-node-from-doubly-linked-list-java","tag-sap-labs-india-pvt-ltd-interview-questions-and-answers","tag-sapient-consulting-pvt-ltd-interview-questions-and-answers","tag-tech-mahindra-interview-questions-and-answers","tag-tracxn-technologies-pvt-ltd-interview-questions-and-answers","tag-unitedhealth-group-interview-questions-and-answers","tag-wipro-infotech-interview-questions-and-answers","tag-wm-global-technology-services-india-pvt-ltd-limited-wmgts-interview-questions-and-answers","tag-write-a-function-to-delete-a-node-from-doubly-linked-list","tag-write-a-function-to-delete-a-node-from-doubly-linked-list-java","tag-xoriant-solutions-pvt-ltd-interview-questions-and-answers","tag-yodlee-infotech-pvt-ltd-interview-questions-and-answers"],"yoast_head":"\n