---

Algorithm for inserting a node at the End in circular doubly linked list

---

Step 1: IF AVAIL = NULL 
         Write OVERFLOW 
         Go to Step 12 
        [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 NEW_NODE -> NEXT = START
Step 6: SET PTR = START 
Step 7: Repeat Step 8 while PTR -> NEXT != START 
Step 8: SET PTR = PTR -> NEXT 
        [END OF LOOP]
Step 9: SET PTR -> NEXT = NEW_NODE
Step 10: SET NEW_NODE -> PREV = PTR  
Step 11: SET START -> PREV = NEW_NODE
Step 12: EXIT

---