The goal of the Project is to

- practice reading UML class diagram and working with interface

- practice how to manage and provide sufficient operations on a doubly-linked circular list, for example, inserting and deleting items from a doubly-linked circular list

Doubly-linked Circular List

Circular Doubly Linked List has properties of both doubly linked list and circular linked list.

A DoublyLinkedList (DLL)is alinked data structurethat consists of a set of sequentially linkedrecords called doubly linked nodes. Each node contains threefields: two link fields (references to the previous and to the next node in the sequence of nodes) and one data field.

In a doubly linked list, we use two references, first and last, pointing to two endpoints of the list. The first and last nodes' previousandnext links, respectively, point to null.

This DoublyLinkedList (DLL) can be conceptualized as two singly linked lists formed from the same data items, but in opposite sequential orders.