Figure of circular queue
R->Rear
F->Front
Initially rear=front=0
Circular queue is as shown in figure it is like a array size in which element are from 0 to (n-1) if array is of length n it is divided into nodes of equal size and and equal to number of size of queue.In this insertion is carried out from the rear node and deletion take place from front node.when we insert number rear moves to rear+1 and when we delete any element front moves to front-1 and when queue is filled the rear+1=front.
