title: Deleting a middle node from a single linked list when pointer to the previous node is not available
body: <p>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 the previous node?After deletion the previous node should point to the node next to deleted node. </p>