A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. we maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue respectively. [G17S2Q13]

Explanation