Define Circular Queue. Describe implementation of Circular Queue ?
Answer in Short
Circular queue is a linear data structure. It follows FIFO principle. In circular queue the last node is connected back to the first node to make a circle. For the implementation of Circular queue please refer to image.Explanation
1206
0
==> Circular queue--
- Circular queue is a linear data structure. It follows FIFO principle
- In circular queue the last node is connected back to the first node to make a circle
- In circular queue the last node is connected back to the first node to make a circle
- Both the front and the rear pointers points to the beginning of the array.
- It is also called as “Ring buffer”.
.png)
.png)