AlgoViz: Interactive Algorithm Visualization Tool

Circular Queue

Category: Data Structures | Time: O(1) | Space: O(k)

Input Data

Visualization

Visual representation of the data structure

Enter commands to start the circular queue visualization.

About Circular Queue

A Circular Queue is a linear data structure that follows the FIFO principle but its last position is connected back to the first position to make a circle. It is also called 'Ring Buffer'. It's an efficient implementation of a queue using a fixed-size array.

Code Editor

The code is for reference. Editing it won't affect the visualization.

class CircularQueue {
    constructor(size) {
        this.size = size;
        this.queue = new Array(size);
        this.front = -1;
        this.rear = -1;
    }
    enqueue(data) {
        if ((this.rear + 1) % this.size === this.front) {
            return "Queue is full";
        }
        if (this.front === -1) this.front = 0;
        this.rear = (this.rear + 1) % this.size;
        this.queue[this.rear] = data;
    }
    dequeue() {
        if (this.front === -1) {
            return "Queue is empty";
        }
        let data = this.queue[this.front];
        if (this.front === this.rear) {
            this.front = -1;
            this.rear = -1;
        } else {
            this.front = (this.front + 1) % this.size;
        }
        return data;
    }
}

What is a Circular Queue?

Why use a Circular Queue over a simple array-based queue?

How do the 'front' and 'rear' pointers work?

How do you check if a Circular Queue is full or empty?

What are the time and space complexities?

What are common applications?

Where can I learn more?