Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?

Answer 1

As per the Salil's Suggestion:

Algorithm:
Delete the next node of this node (which is simple), copy the data of the next node to this node

Code

void deleteNode(struct node *node_ptr)
{
   struct node *temp = node_ptr->next; // Pick the next node
   node_ptr->data    = temp->data; // Copy the next node data to this node 
   node_ptr->next    = temp->next; // Align pointers 
   free(temp); // Delete the next node
}

Comments

There is one limitation in this problem. Node to be deleted  must not be the last one.

---

Good catch...may be traversing is better foolproof but costly approach.