---

Algorithm for inserting a node at the Beginning in Circular Doubly Linked List

---

Step 1: IF AVAIL = NULL 
         Write OVERFLOW 
         Go to Step 13 
        [END OF IF] 
Step 2: SET NEW_NODE = AVAIL  
Step 3: SET AVAIL = AVAIL -> NEXT 
Step 4: SET NEW_NODE -> DATA = VAL 
Step 5: SET PTR = START 
Step 6: Repeat Step 7 while PTR -> NEXT != START 
Step 7: SET PTR = PTR -> NEXT 
        [END OF LOOP]
Step 8: SET PTR -> NEXT = NEW_NODE
Step 9: SET NEW_NODE -> PREV = PTR 
Step 10 : SET NEW_NODE -> NEXT = START 
Step 11: SET START -> PREV = NEW_NODE
Step 12: SET START = NEW_NODE
Step 13: EXIT

---