you are given a pointer to a node in a singly linked list. Delete that node. No other information is known.
Sigiloso
1) Copy the next node data to the given pointer. 2) Get and assign the next-to-next node pointer. 3) Delete the next node Given Ptr to be deleted Ptr->data = Ptr->next->data; temp = Ptr->next; Ptr->next = Ptr->next->next; delete temp