Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Given linked list – head = [4,5,1,9], which looks like following:
4 -> 5 -> 1 -> 9
The linked list will have at least two elements.
All of the nodes’ values will be unique.
The given node will not be the tail and it will always be a valid node of the linked list.
Do not return anything from your function.
Pretty self explanatory. Runs and has space in
O(1). You can’t delete from the tail, in which case you would raise an exception if there is no next pointer, but that was an assumption here that it would be valid.