Question

Given only a pointer to the node to be deleted , how do we delete the node in the linked list…?

Answer 1

The question is too ambiguous, and is likely that way for a reason (e.g. to spawn a conversation instead of test your actual knowledge of the data structure). They are likely expecting you to ask “Is this a doubly linked list or a singly linked list?” If it is a doubly linked list, its a simple matter:

curr->prev->next = curr->next;
curr->next->prev = curr->prev;
delete curr;

If it is a singly linked list, you must have the head node so you can find the previous node in the list. So they are likely expecting you to ask if you have a pointer to the head node. The pseudo-code would then be:

loop from head to end until test->next == curr
test->next = curr->next;
delete curr;

Alternatively, if you can modify the list (without the head node):

temp = curr->next;
curr->data = temp->data;
curr->next = temp->next;
delete temp;