Description
Objectives
-
Create a doubly linked list containing a dummy node.
-
Modify the implementation of a linked list to add methods.
-
Resolve problems that require knowledge of interfaces.
Circular queue Singly and doubly linked list
Circular queues are a type of queues that implements the principle of First In First Out (FIFO). In these queues, the last element is linked back to the first in order to create a loop. These queues use one instance variable for the head of the queue and one for the tail of the queue.
When we add an element using enqueue(), we add the element at the position of the tail and increment the pointer tail. When we remove an element using dequeue(), we remove and return the element at the position of the head pointer and increase that pointer.
Here is a visual representation of a circular queue and its use. We can represent it via an array where the last element links to the first, or like a circular array.
