Double-Ended Queue (Deque) Visualizer: Step-by-Step Animation & Complexity

Double-Ended Queue (Deque)

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

Input Data

Visualization

Visual representation of the data structure

Enter commands to start deque visualization.

About Double-Ended Queue (Deque)

A Deque, or double-ended queue, is a generalized version of a Queue. Elements can be added or removed from either the front or the rear, providing maximum flexibility.

Code Editor

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

class Deque {
  constructor() {
    this.items = [];
  }
  addFront(element) {
    this.items.unshift(element);
  }
  addRear(element) {
    this.items.push(element);
  }
  removeFront() {
    if(this.isEmpty()) return "Underflow";
    return this.items.shift();
  }
  removeRear() {
    if(this.isEmpty()) return "Underflow";
    return this.items.pop();
  }
  // ... other helper methods
}

Frequently Asked Questions

About Double-Ended Queue (Deque)

What is a Deque?

What are the primary operations of a Deque?

How is a Deque different from a Queue or a Stack?

What is the time complexity of deque operations?

Where are deques used?

Where can I learn more?