2. Circular Doubly Linked List Here, in addition to the last node storing the address of the first node, the first node will also store the address of the last node. Circular Doubly Linked List Representation Note: We will be using the singly circular linked list to represent the working...