Deleting a middle node from a single linked list when pointer to the previous node is not available

Question

Is it possible to delete a middle node in the single linked list when the only information available we have is the pointer to the node to be deleted and not the pointer to

Answer 1

Maybe do a soft delete? (i.e., set a "deleted" flag on the node) You can clean up the list later if you need to.