Delete a Circular-Linked List's Tail Node

Given a circular-linked list, write a function to delete its tail node and return the modified list's head.

*x = indicates head node
1->2->3->4->*1 ==> 1->2->3->*1

Need a hand? Try out these hints, one at a time.

The key here is to traverse to the node which points to head and make its previous node point to the head node.

1. Traverse over to the node which points to head. Call it currentNode. Keep track of the node which points to this node - prevNode.

2. Point prevNode's next to head.

3. Point currentNode's next to null.

4. Return the original head.

public ListNode deleteAtTail(ListNode head) {
    




}

Java

Python