Circular Queue in Data Structure

There are Few types of Queue:

1. Simple Queue

2. Circular Queue

3. Priority Queue

4. Dequeue (Double Ended Queue)

2. Circular Queue

• In a circular queue, all nodes are treated as circular. Last node is connected back to the first node.
• Circular queue is also called as Ring Buffer.
• It is an abstract data type.
• Circular queue contains a collection of data which allows insertion of data at the end of the queue and deletion of data at the beginning of the queue.

The above figure shows the structure of circular queue. It stores an element in a circular way and performs the operations according to its FIFO structure.

Output:

1.Insert

2. Display

3. Delete