Question

Given only a pointer to a node (not the head) in a singly linked list, and no access to the node's predecessor, what is the standard technique used to 'delete' that given node from the list?

Q: Answer-Given only a pointer to a node (not the head) in a singly linked list, and no access to the node's p...

Without access to the predecessor, the given node itself cannot be unlinked directly. Instead, the standard trick is to copy the data from the next node into the current node, and then delete the next node by adjusting the current nodes next pointer to skip over it effectively achieving the same end result in O1 time, without needing a predecessor pointer.