Delete a Doubly Linked List node at a given position Last Updated : 31 Aug, 2024 Comments Improve Suggest changes Like Article Like Report Given a doubly linked list and a position pos, the task is to delete the node at the given position from the beginning of Doubly Linked List.Input: LinkedList: 1<->2<->3, pos = 2Output: LinkedList: 1<->3Input: LinkedList: 1<->2<->3, pos = 1Output: LinkedList: 2<->3Delete Node at position 2 in Doubly Linked ListTo delete a node at a specific position in doubly linked list, we can use the following steps:Traverse to the node at the specified position, say curr.If the position is valid, adjust the pointers to skip the node to be deleted.If curr is not the head of the linked list, update the next pointer of the node before curr to point to the node after curr, curr->prev->next = curr-next.If curr is not the last node of the linked list, update the previous pointer of the node after curr to the node before curr, curr->next->prev = curr->prev.Free the memory allocated for the deleted node. C++ // C++ Program to delete node at a specific position // in Doubly Linked List #include <iostream> using namespace std; class Node { public: int data; Node * prev; Node * next; Node(int d) { data = d; prev = next = NULL; } }; // Function to delete a node at a specific position // in the doubly linked list Node * delPos(Node* head, int pos) { // If the list is empty if (head == NULL) return head; Node * curr = head; // Traverse to the node at the given position for (int i = 1; curr != NULL && i < pos; ++i) { curr = curr -> next; } // If the position is out of range if (curr == NULL) return head; // Update the previous node's next pointer if (curr -> prev != NULL) curr -> prev -> next = curr -> next; // Update the next node's prev pointer if (curr -> next != NULL) curr -> next -> prev = curr -> prev; // If the node to be deleted is the head node if (head == curr) head = curr -> next; // Deallocate memory for the deleted node delete curr; return head; } void printList(Node * head) { Node * curr = head; while (curr != nullptr) { cout << curr -> data << " "; curr = curr -> next; } cout << endl; } int main() { // Create a hardcoded doubly linked list: // 1 <-> 2 <-> 3 Node * head = new Node(1); head -> next = new Node(2); head -> next -> prev = head; head -> next -> next = new Node(3); head -> next -> next -> prev = head -> next; head = delPos(head, 2); printList(head); return 0; } C // C Program to delete node at a specific position // in Doubly Linked List #include <stdio.h> #include <stdlib.h> struct Node { int data; struct Node* prev; struct Node* next; }; // Function to delete a node at a specific position // in the doubly linked list struct Node* delPos(struct Node* head, int pos) { // If the list is empty if (head == NULL) return head; struct Node* curr = head; // Traverse to the node at the given position for (int i = 1; curr != NULL && i < pos; ++i) { curr = curr->next; } // If the position is out of range if (curr == NULL) return head; // Update the previous node's next pointer if (curr->prev != NULL) curr->prev->next = curr->next; // Update the next node's prev pointer if (curr->next != NULL) curr->next->prev = curr->prev; // If the node to be deleted is the head node if (head == curr) head = curr->next; // Deallocate memory for the deleted node free(curr); return head; } void printList(struct Node* head) { struct Node* curr = head; while (curr != NULL) { printf("%d ", curr->data); curr = curr->next; } printf("\n"); } struct Node* createNode(int d) { struct Node* new_node = (struct Node*)malloc(sizeof(struct Node)); new_node->data = d; new_node->prev = NULL; new_node->next = NULL; return new_node; } int main() { // Create a hardcoded doubly linked list: // 1 <-> 2 <-> 3 struct Node* head = createNode(1); head->next = createNode(2); head->next->prev = head; head->next->next = createNode(3); head->next->next->prev = head->next; head = delPos(head, 2); printList(head); return 0; } Java // Java Program to delete node at a specific position // in Doubly Linked List class Node { int data; Node prev; Node next; Node(int d) { data = d; prev = next = null; } } public class GfG { // Function to delete a node at a specific position // in the doubly linked list static Node delPos(Node head, int pos) { // If the list is empty if (head == null) return head; Node curr = head; // Traverse to the node at the given position for (int i = 1; curr != null && i < pos; ++i) { curr = curr.next; } // If the position is out of range if (curr == null) return head; // Update the previous node's next pointer if (curr.prev != null) curr.prev.next = curr.next; // Update the next node's prev pointer if (curr.next != null) curr.next.prev = curr.prev; // If the node to be deleted is the head node if (head == curr) head = curr.next; // Deallocate memory for the deleted node curr = null; return head; } static void printList(Node head) { Node curr = head; while (curr != null) { System.out.print(curr.data + " "); curr = curr.next; } System.out.println(); } public static void main(String[] args) { // Create a hardcoded doubly linked list: // 1 <-> 2 <-> 3 Node head = new Node(1); head.next = new Node(2); head.next.prev = head; head.next.next = new Node(3); head.next.next.prev = head.next; head = delPos(head, 2); printList(head); } } Python # Python Program to delete node at a specific position # in Doubly Linked List class Node: def __init__(self, data): self.data = data self.prev = None self.next = None # Function to delete a node at a specific position # in the doubly linked list def del_pos(head, pos): # If the list is empty if head is None: return head curr = head for i in range(1, pos): if curr is None: break curr = curr.next if curr is None: return head # Update the previous node's next pointer if curr.prev is not None: curr.prev.next = curr.next # Update the next node's prev pointer if curr.next is not None: curr.next.prev = curr.prev # If the node to be deleted is the head node if head == curr: head = curr.next # Deallocate memory for the deleted node del curr return head def print_list(head): curr = head while curr is not None: print(curr.data, end=" ") curr = curr.next print() if __name__ == "__main__": # Create a hardcoded doubly linked list: # 1 <-> 2 <-> 3 head = Node(1) head.next = Node(2) head.next.prev = head head.next.next = Node(3) head.next.next.prev = head.next head = del_pos(head, 2) print_list(head) C# // C# Program to delete node at a specific position // in Doubly Linked List using System; class Node { public int Data; public Node prev; public Node next; public Node(int data) { Data = data; prev = null; next = null; } } // Function to delete a node at a specific position // in the doubly linked list class GfG { static Node DelPos(Node head, int pos) { // If the list is empty if (head == null) return head; Node curr = head; // Traverse to the node at the given position for (int i = 1; curr != null && i < pos; ++i) { curr = curr.next; } // If the position is out of range if (curr == null) return head; // Update the previous node's next pointer if (curr.prev != null) curr.prev.next = curr.next; // Update the next node's prev pointer if (curr.next != null) curr.next.prev = curr.prev; // If the node to be deleted is the head node if (head == curr) head = curr.next; // Deallocate memory for the deleted node // In C#, the garbage collector handles this automatically return head; } static void PrintList(Node head) { Node curr = head; while (curr != null) { Console.Write(curr.Data + " "); curr = curr.next; } Console.WriteLine(); } static void Main() { // Create a hardcoded doubly linked list: // 1 <-> 2 <-> 3 Node head = new Node(1); head.next = new Node(2); head.next.prev = head; head.next.next = new Node(3); head.next.next.prev = head.next; head = DelPos(head, 2); PrintList(head); } } JavaScript // JavaScript Program to delete node at a specific position // in Doubly Linked List class Node { constructor(data) { this.data = data; this.prev = null; this.next = null; } } // Function to delete a node at a specific position // in the doubly linked list function delPos(head, pos) { // If the list is empty if (head === null) return head; let curr = head; // Traverse to the node at the given position for (let i = 1; curr !== null && i < pos; ++i) { curr = curr.next; } // If the position is out of range if (curr === null) return head; // Update the previous node's next pointer if (curr.prev !== null) curr.prev.next = curr.next; // Update the next node's prev pointer if (curr.next !== null) curr.next.prev = curr.prev; // If the node to be deleted is the head node if (head === curr) head = curr.next; return head; } function printList(head) { let curr = head; while (curr !== null) { console.log(curr.data + " "); curr = curr.next; } console.log(); } // Create a hardcoded doubly linked list: // 1 <-> 2 <-> 3 let head = new Node(1); head.next = new Node(2); head.next.prev = head; head.next.next = new Node(3); head.next.next.prev = head.next; head = delPos(head, 2); printList(head); Output1 3 Time Complexity: O(n), where n is the number of nodes in the doubly linked list.Auxiliary Space: O(1) Comment More infoAdvertise with us Next Article How to Create a Doubly Linked List in C? A Ayush Jauhari Improve Article Tags : Linked List DSA doubly linked list Practice Tags : Linked List Similar Reads Doubly Linked List meaning in DSA A doubly linked list is a special type of linked list in which each node contains a pointer to the previous node as well as the next node in the structure. Doubly Linked ListCharacteristics of the Doubly Linked List: The characteristics of a doubly linked list are as follows: Dynamic size: The size 3 min read Doubly Linked List Tutorial A doubly linked list is a more complex data structure than a singly linked list, but it offers several advantages. The main advantage of a doubly linked list is that it allows for efficient traversal of the list in both directions. This is because each node in the list contains a pointer to the prev 8 min read Difference between Singly linked list and Doubly linked list Introduction to Singly linked list : A singly linked list is a set of nodes where each node has two fields 'data' and 'link'. The 'data' field stores actual piece of information and 'link' field is used to point to next node. Basically the 'link' field stores the address of the next node. Introducti 2 min read Applications, Advantages and Disadvantages of Doubly Linked List Doubly linked list is a type of linked list in which nodes contains information and two pointers i.e. left pointer and right pointer. The left pointer in the doubly linked list points to the previous node and the right pointer points to the next node in the linked list. The first node of the doubly 4 min read Operations on Doubly LinkedOperations of Doubly Linked List with ImplementationA Doubly Linked List (DLL) contains an extra pointer, typically called the previous pointer, together with the next pointer and data which are there in a singly linked list. Below are operations on the given DLL: Add a node at the front of DLL: The new node is always added before the head of the giv 15+ min read Insertion in a Doubly Linked ListInserting a new node in a doubly linked list is very similar to inserting new node in linked list. There is a little extra work required to maintain the link of the previous node. In this article, we will learn about different ways to insert a node in a doubly linked list.Table of ContentInsertion a 6 min read Search an element in a Doubly Linked ListGiven a Doubly linked list(DLL) containing n nodes and an integer x, the task is to find the position of the integer x in the doubly linked list. If no such position found then print -1.Examples:Input: Linked List = 18 <-> 15 <-> 8 <-> 9 <-> 14, x = 8 Output: 3 Explanation: x 7 min read Deletion in a Doubly Linked ListDeleting a node in a doubly linked list is very similar to deleting a node in a singly linked list. However, there is a little extra work required to maintain the links of both the previous and next nodes. In this article, we will learn about different ways to delete a node in a doubly linked list.E 15+ min read Delete a Doubly Linked List node at a given positionGiven a doubly linked list and a position pos, the task is to delete the node at the given position from the beginning of Doubly Linked List.Input: LinkedList: 1<->2<->3, pos = 2Output: LinkedList: 1<->3Input: LinkedList: 1<->2<->3, pos = 1Output: LinkedList: 2<-> 9 min read Doubly Linked List in Different LanguagesHow to Create a Doubly Linked List in C? A doubly linked list is a type of linked list in which each node contains a pointer to both the next node and the previous node. This allows traversal in both forward and backward directions. Each node in a doubly linked list stores data, a pointer to the next node, and a pointer to the previous nod 4 min read Introduction to Doubly Linked Lists in Java Doubly linked list is a data structure that has reference to both the previous and next nodes in the list. It provides simplicity to traverse, insert and delete the nodes in both directions in a list. In a doubly linked list, each node contains three data members: data: The data stored in the nodene 11 min read Implementation of Doubly Linked List in JavaScript This article will demonstrate the Implementation of Doubly Linked List In JavaScript. A doubly linked list (DLL) is a special type of linked list in which each node contains a pointer to the previous node as well as the next node of the linked list. Doubly Linked List in JavaScriptTo create we have 4 min read Memory efficient doubly linked list We need to implement a doubly linked list with the use of a single pointer in each node. For that we are given a stream of data of size n for the linked list, your task is to make the function insert() and getList(). The insert() function pushes (or inserts at the beginning) the given data in the li 9 min read Like