Implement a Circular Queue data structure using a singly linked list. The implementation should provide the following basic queue operations:
Enqueue: Add an element to the rear of the queue.
Dequeue: Remove an element from the front of the queue.
Display: Print all the elements in the queue in a circular manner.
isEmpty: Check if the queue is empty.
Implement a Circular Queue data structure using a singly linked list. The implementation should provide the following basic queue operations:
Enqueue: Add an element to the rear of the queue. Dequeue: Remove an element from the front of the queue. Display: Print all the elements in the queue in a circular manner. isEmpty: Check if the queue is empty.