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 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 head pointer. Conventional deletion is impossible without knowledge of previous node of node which need to be deleted.

The trick here is we can copy the data of next node to the data field of current node to be deleted. Then we can move one step forward. Now our next has become the current node and current has become 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 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.

`void` `deleteNodeWithoutHead(` `struct` `Node* pos) ` `{ ` ` ` `if` `(*pos == NULL) ` `// If linked list is empty ` ` ` `return` `; ` ` ` ` ` `else` `{ ` ` ` `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); ` ` ` `} ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

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.

## Recommended Posts:

- Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
- Given only a pointer/reference to a node to be deleted in a singly linked list, how do you delete it?
- How to write C functions that modify head pointer of a Linked List?
- Make middle node head in a linked list
- Find kth node from Middle towards Head of a Linked List
- Delete multiple occurrences of key in Linked list using double pointer
- Point to next higher value node in a linked list with an arbitrary pointer
- Delete a given node in Linked List under given constraints
- Delete a node in a Doubly Linked List
- Delete a Linked List node at a given position
- Delete every Kth node from circular linked list
- Point arbit pointer to greatest value right side node in a linked list
- Delete a Doubly Linked List node at a given position
- Recursive function to delete k-th node from linked list
- Sorted insert in a doubly linked list with head and tail pointers

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.