7: Remove Operation from Double Linked List & Circular linked list

Remove Operation from Double Linked List
& Circular linked list

Double-Linked List, Removal (Deletion) Operation.

There are four cases, which can occur while removing the node.

Note:
If List has only one node, which is indicated by the condition, that the head points to the same node as the tail, the removal is quite simple by set both head and tail to null.


Circular Linked List

In single linked list, every node points to its next node in the sequence and the last node points NULL. But in circular linked list, every node points to its next node in the sequence but the last node points to the first node in the list.