AlgoViz: Interactive Algorithm Visualization Tool

Queue

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

Input Data

Visualization

Visual representation of the data structure

Enter commands to start queue visualization.

About Queue

A linear data structure that follows the First-In, First-Out (FIFO) principle. Elements are added (enqueued) at the rear and removed (dequeued) from the front, like a line of people.

Code Editor

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

class Queue {
  constructor() {
    this.items = [];
  }
  enqueue(element) {
    this.items.push(element);
  }
  dequeue() {
    if (this.isEmpty()) {
      return "Underflow";
    }
    return this.items.shift();
  }
  front() {
    return this.items[0];
  }
  isEmpty() {
    return this.items.length === 0;
  }
}

Frequently Asked Questions

About Queue

What is a Queue?

What are the primary operations of a Queue?

What is the time complexity of queue operations?

Where are queues used in computing?

How can you implement a Queue?

Where can I learn more?