You are given a singly linked list and pointer which is pointing to the node which is required to be deleted. Any information about head pointer or any other node is not given. You need to write a function to delete that node from linked list. Your function will take only one argument: pointer to the node which is to be deleted.

Examples:

A linked list is built as:

Defination of each node is as follows: struct Node { int data; struct Node* next; }; Input : C (a pointer to C) Output : A-->B-->D-->E-->F Input : A (a pointer to A) Output : B-->D-->E-->F

It would be a simple deletion problem from the singly linked list if the head pointer was given because for deletion you must know the previous node and you can easily reach there by traversing from the head pointer. Conventional deletion is impossible without knowledge of the previous node of a node which needs to be deleted.

The trick here is we can copy the data of the next node to the data field of the current node to be deleted. Then we can move one step forward. Now our next has become the current node and current has become the previous node. Now we can easily delete the current node by conventional deletion methods.

For example, suppose we need to delete C and a pointer to C is given. If we had a pointer to B we could have deleted C easily. But here we will copy the data field of D to the data field of C. Then we will move forward. Now we are at D and we have a pointer to C i.e. the previous pointer. So we will delete D. That’s how the node C will be deleted.

Below image is a dry run of the above approach:

Below is the implementation of the above approach :

`// C++ program to delete a node ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `/* Link list node */` `struct` `Node { ` ` ` `int` `data; ` ` ` `struct` `Node* next; ` `}; ` ` ` `// Fucntion to delete the node without head ` `void` `deleteNodeWithoutHead(` `struct` `Node* pos) ` `{ ` ` ` `if` `(pos == NULL) ` `// If linked list is empty ` ` ` `return` `; ` ` ` `else` `{ ` ` ` ` ` `if` `(pos->next == NULL) { ` ` ` `printf` `(` `"This is last node, require head, can't be freed\n"` `); ` ` ` `return` `; ` ` ` `} ` ` ` ` ` `struct` `Node* temp = pos->next; ` ` ` ` ` `// Copy data of the next node to current node ` ` ` `pos->data = pos->next->data; ` ` ` ` ` `// Perform conventional deletion ` ` ` `pos->next = pos->next->next; ` ` ` ` ` `free` `(temp); ` ` ` `} ` `} ` ` ` `// Function to print the linked list ` `void` `print(Node* head) ` `{ ` ` ` `Node* temp = head; ` ` ` `while` `(temp) { ` ` ` `cout << temp->data << ` `" -> "` `; ` ` ` `temp = temp->next; ` ` ` `} ` ` ` ` ` `cout << ` `"NULL"` `; ` `} ` ` ` `void` `push(` `struct` `Node** head_ref, ` `int` `new_data) ` `{ ` ` ` `/* allocate node */` ` ` `struct` `Node* new_node = ` `new` `Node(); ` ` ` ` ` `/* put in the data */` ` ` `new_node->data = new_data; ` ` ` ` ` `/* link the old list off the new node */` ` ` `new_node->next = (*head_ref); ` ` ` ` ` `/* move the head to point to the new node */` ` ` `(*head_ref) = new_node; ` `} ` ` ` `// Driver Code ` `int` `main() ` `{ ` ` ` `/* Start with the empty list */` ` ` `struct` `Node* head = NULL; ` ` ` ` ` `// create linked 35->15->4->20 ` ` ` `push(&head, 20); ` ` ` `push(&head, 4); ` ` ` `push(&head, 15); ` ` ` `push(&head, 35); ` ` ` `cout << ` `"Initial Linked List: \n"` `; ` ` ` `print(head); ` ` ` `cout << endl ` ` ` `<< endl; ` ` ` ` ` `// Delete 15 without sending head ` ` ` `Node* del = head->next; ` ` ` `deleteNodeWithoutHead(del); ` ` ` ` ` `// Print the final linked list ` ` ` `cout << ` `"Final Linked List after deletion of 15:\n"` `; ` ` ` `print(head); ` ` ` ` ` `return` `0; ` ` ` ` ` `// This code has been contributed by Striver ` `} ` |

*chevron_right*

*filter_none*

**Output:**

Initial Linked List: 35 -> 15 -> 4 -> 20 -> NULL Final Linked List after deletion of 15: 35 -> 4 -> 20 -> NULL

This article is contributed by Jeet Jain. Please see Given only a pointer to a node to be deleted in a singly linked list, how do you delete it? for more details and complete implementation.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- How to write C functions that modify head pointer of a Linked List?
- Given only a pointer/reference to a node to be deleted in a singly linked list, how do you delete it?
- Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
- Find kth node from Middle towards Head of a Linked List
- Make middle node head in a linked list
- Delete multiple occurrences of key in Linked list using double pointer
- Sorted insert in a doubly linked list with head and tail pointers
- Point to next higher value node in a linked list with an arbitrary pointer
- Point arbit pointer to greatest value right side node in a linked list
- Delete a node in a Doubly Linked List
- Delete a given node in Linked List under given constraints
- Delete every Kth node from circular linked list
- Delete Nth node from the end of the given linked list
- Delete a Linked List node at a given position
- Recursive function to delete k-th node from linked list
- Delete a Doubly Linked List node at a given position
- Java Program to Delete a Node From the Middle of the Circular Linked List
- Create new linked list from two given linked list with greater element at each node
- Clone a linked list with next and random pointer | Set 1
- Clone a linked list with next and random pointer | Set 2

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.