Delete a Node from linked list without head pointer

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

Note: No head reference is given to you. It is guaranteed that the node to be deleted is not the last node:

A linked list is built as: 

Definition of each node is as follows: 
struct Node {
    int data;
    struct Node* next;
}; 

Examples: 

Consider below LL for given examples:

👁 Image

Input: C (a pointer to C)
Output: A-->B-->D-->E-->F

Input: A (a pointer to A)
Output: B-->D-->E-->F

Approach: To solve the problem follow the below idea:

• Why conventional deletion method would fail here?
  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 that needs to be deleted. 
• How to delete the node when you dont have the head pointer?
  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 the current has become the previous node. Now we can easily delete the current node by conventional deletion methods. 

Illustration of the above approach:

For example, suppose we need to delete B and a pointer to B is given

If we had a pointer to A, we could have deleted B easily. 
But here we will copy the data field of C to the data field of B. Then we will move forward. 

Now we are at C and we have a pointer to B i.e. the previous pointer. So we will delete C. 

That's how node B will be deleted. 

Below image is a dry run of the above approach:

👁 Image

Below is the implementation of the above approach:

Initial Linked List: 
35 -> 15 -> 4 -> 20 -> NULL

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

Time complexity: O(1) since performing constant operations and modifying only a single pointer to delete node
Auxiliary Space: O(1)

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.