$1.$ Create a doubly linked list.

$2.$ Implement methods to insert nodes, delete nodes, and traverse the list in both forward

and reverse directions.

$3.$ Complete the skeleton code where needed in the TODOs.

class DoublyLinkedList $\{$

$//$Node class to represent each node in the doubly linked list

class Node $\{$

int data;

Node prev;

Node next;

Node$($int data$)\{$

this.data $=$ data;

this.prev $=$ null;

this.next $=$ null;

$\}$

$\}$

private Node head $=$ null;

private Node tail $=$ null;

$//$Method to insert a node at the end

public void insertAtEnd$($int data$)\{$

Node newNode $=$ new Node$($data$)$;

if $($head $==$ null$)\{$

head $=$ newNode;

tail $=$ newNode;

$\}$ else $\{$

tail.next $=$ newNode;

newNode.prev $=$ tail;

tail $=$ newNode;

$\}$

$\}$

$//$TODO: Method to insert a node at the beginning

public void insertAtBeginning$($int data$)\{$

$//$ Implement insertion logic

$\}$

$//$TODO: Method to delete a node with a specific value

public void deleteByValue$($int data$)\{$

$//$ Implement deletion logic

$\}$

$//$TODO: Method to traverse the list forward

public void displayForward$()\{$

$//$ Implement forward traversal logic

$\}$

$//$TODO: Method to traverse the list backward

public void displayBackward$()\{$

$//$ Implement backward traversal logic

$\}$

public static void main$($String$[]$ args$)\{$

DoublyLinkedList dll $=$ new DoublyLinkedList$()$;

$//$Insert nodes at the end

dll$.$insertAtEnd$(10)$;

dll$.$insertAtEnd$(20)$;

dll$.$insertAtEnd$(30)$;

$//$TODO: Insert at the beginning

dll$.$insertAtBeginning$(5)$;

$//$Display list forward

dll$.$displayForward$()$; $//$Expected Output: $5102030$

$//$TODO: Delete a node and display the list again

dll$.$deleteByValue$(20)$;

dll$.$displayForward$()$; $//$Expected Output: $51030$

$//$ TODO: Display list backward

dll$.$displayBackward$()$; $//$Expected Output: $30105$

$\}$

$\}$