Delete Node in a Linked List

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

Supposed the linked list 1 -> 2 -> 3 -> 4 is and you are given the third node with value 3 , the linked list should be Come after 1 -> 2 -> 4 calling your function.

/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode (int x): Val (x), Next (NULL) {}
* };
*/
Class Solution {
Public
void Deletenode (listnode* node) {
As a matter of fact, it would be nice to overwrite the value of the next node with the current node and then delete the next node. Note that this does not apply to tail nodes
Node->val = node->next->val;
Node->next = node->next->next;

}
};

Delete Node in a Linked List