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

Example 1:
Input: head = [4,5,1,9], node = 5
Output: [4,1,9]
Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.

Example 2:
Input: head = [4,5,1,9], node = 1
Output: [4,5,9]
Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.

Note:
1. The linked list will have at least two elements.
2. All of the nodes' values will be unique.
3. The given node will not be the tail and it will always be a valid node of the linked list.
4. Do not return anything from your function.

``````/*
* 237. Delete Node in a Linked List
*/

public class DeleteNode {
public static void main(String[] args) {
for (int i = 2; i < 10; i++) {
node.next = new ListNode(i);
node = node.next;
}

DeleteNode solution = new DeleteNode();

}

private void deleteNode(ListNode node) {
node.val = node.next.val;
node.next = node.next.next;
}

private void print(ListNode node) {
for (; node != null; node = node.next) {
System.out.print(node.val);
System.out.print("->");
}
System.out.println("null");
}
}``````