Write JAVA functions to implement DELETE_FIRST_NODE and TRAVERSEoperations in doubly linked lis

Sure, here are the Java functions to implement DELETE_FIRST_NODE and TRAVERSE operations in a doubly linked list.

First, let's define the Node class:

class Node {
    int data;
    Node prev;
    Node next;

    // constructor to create a new node
    Node(int d) {
        data = d;
        prev = null;
        next = null;
    }
}

Now, let's define the DoublyLinkedList class:

class DoublyLinkedList {
    Node head; // head of list

    // Function to delete the first node of the Doubly Linked List
    void deleteFirstNode() {
        if (head == null) {
            System.out.println("List is empty");
            return;
        }
        else {
            if (head != null) {
                head = head.next; // make the next node as head
                if (head != null)
                    head.prev = null; // remove the prev of new head
            }
        }
    }

    // Function to traverse the Doubly Linked List
    void traverse() {
        Node node = head;
        if (node == null) {
            System.out.println("List is empty");
            return;
        }
        while (node != null) {
            System.out.print(node.data + " ");
            node = node.next;
        }
    }
}

You can use these functions in your main method like this:

public class Main {
    public static void main(String[] args) {
        DoublyLinkedList dll = new DoublyLinkedList();
        dll.head = new Node(1);
        Node second = new Node(2);
        Node third = new Node(3);

        dll.head.next = second;
        second.prev = dll.head;
        second.next = third;
        third.prev = second;

        dll.traverse(); // prints: 1 2 3
        dll.deleteFirstNode();
        dll.traverse(); // prints: 2 3
    }
}

This will create a doubly linked list with three nodes, traverse the list, delete the first node, and then traverse the list again to show the updated list.