2.3 Delete Middle Node: Implement an algorithm to delete a node in the middle (Le., any node but the first and last node, not necessarily the exact middle) of a singly linked list, given only access to that node.
EXAMPLE
Input: the node c from the linked list a - >b- >c - >d - >e- >f
Result: nothing is returned, but the new linked list looks like a->b->d->e->f
In this problem, you are not given access to the head of the linked list. You only have access to that node. The solution is simply to copy the data from the next node over to the current node, and then to delete the next node.
boolean deleteNode(LinkedListNode n){
if(n==null || n.next==null){
return false;
}
LinkedListNode next = n.next;
n.data = next.data;
n.next = next.next;
return true;
}
Note that this problem cannot be solved if the node to be deleted is the last node in the linked list. That's okay- your interviewer wants you to point that out, and to discuss how to handle this case. You could, for example, consider marking the node as dummy.
