Delete Middle Node
problem
Implment an algorithm to delete a node in the middle of a singly linked list. But you can only access to that node.
note
The solution is simply to copy the data from the next node over to the current node.
Implment an algorithm to delete a node in the middle of a singly linked list. But you can only access to that node.
The solution is simply to copy the data from the next node over to the current node.