Delete the Node at the Head of a Doubly Linked List

Given a doubly linked list, write a method to delete its head node. Return the modified list's head node.

Examples:
1<=>2<=>3<=>4 ==> 2<=>3<=>4

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

Make the second node of the list the head.

1. Traverse to the second node of the list, if the list has more than two nodes. If it has less than two nodes, simply return null.

2. Set its previous reference to null.

3. Return this new node as the head node.

public DoublyLinkedNode deleteAtHead(DoublyLinkedNode head) {
                



    
}

Java

Python