Circular Doubly Linked List - Insertion at Beginning and at the End | Data Structure

#doublylinkedlistinsertionatbeginning
#doublylinkedlistinsertionattheend
#doublylinkedlist
#DoublyLinkedList
#DoublyLinkedListInsertionatBeginning
#DoublyLinkedListInsertionattheEnd
#LinkedList
#linkedlist
#linkedlistindatastructure
#skinformativespot

In a doubly linked list, insertion at the beginning involves the following steps:
Create a New Node: Allocate memory for the new node and assign the given data.
Set the New Node's Pointers: Set the next pointer of the new node to the current head node, and its prev pointer to null (since it will be the first node).
Update the Current Head: If the list is not empty, update the prev pointer of the current head node to point to the new node.
Change the Head Pointer: Set the head of the list to the new node