Circular Doubly Linked List is discussed in this chapter.Representation, operations, and implementation of Circular Doubly Linked List are covered.Operations include insert rear, delete element, and display.The code example demonstrates the implementation and output of the program.