nsert a Node at the Beginning of a Doubly Linked ListInsert a Node at the Beginning of a Doubly Linked ListConstraints:NAExample:Sample Input:33215Sample Output:5 1 2 3 Explanation:Input: 3 (Size), 3 2 1 (Initial elements), 5 (Insert)Output: List after insertion: 5 1 2 3

To insert a node at the beginning of a doubly linked list, follow these steps:

1. Create a new node with the given value.
2. If the head of the doubly linked list is null, set the new node as the head.
3. If the head of the doubly linked list is not null, set the new node's next pointer to the current head.
4. Set the previous pointer of the current head to the new node.
5. Finally, set the new node as the head of the doubly linked list.

Here is a Python code snippet that demonstrates this:

class Node:
    def __init__(self, data=None):
        self.data = data
        self.next = None
        self.prev = None

class DoublyLinkedList:
    def __init__(self):
        self.head = None

    def insert_at_beginning(self, data):
        if self.head is None:
            self.head = Node(data)
        else:
            new_node = Node(data)
            self.head.prev = new_node
            new_node.next = self.head
            self.head = new_node

# Sample usage:
dll = DoublyLinkedList()
dll.insert_at_beginning(3)
dll.insert_at_beginning(2)
dll.insert_at_beginning(1)
dll.insert_at_beginning(5)

In this example, we first create a doubly linked list and insert 3, 2, and 1. Then we insert 5 at the beginning. The resulting list is 5 -> 1 -> 2 -> 3.