**Concept:**

A circular double linked list has both successor pointer and predecessor pointer in circular manner. The objective behind considering circular double linked list is to simplify the insertion and deletion operations performed on double linked list. In circular double linked list the right link of the right most node points back to the start node and left link of the first node points to the last node. A circular double linked list is shown in figure 3.8.1.

The basic operations in a circular double linked list are:

- Creation
- Insertion.
- Deletion.
- Traversing.

You may be interested in:

Data Structures and Algorithms – MCQs.

Data Structures and Algorithms Online Tests