Arya Shakya

Group: CE

Roll No: 50

Mini Project

Implement a queue using a circularly linked list with the following operations:

• enqueue Inserts an element at the end of the queue
• dequeue Displays and deletes an element from the front of the queue
• rear Displays the last element of the queue
• front Displays the first element of the queue
• isEmpty Returns true if the queue is empty and false otherwise
• isFull Returns true if the queue is full and false otherwise

What are the time complexities of these operations in your implementation?