Implementing Stacks & Queues

What unique capability does this Deque implementation provide?

class Deque {
  constructor() {
    this.items = {};
    this.front = 0;
    this.rear = 0;
  }
  
  addFront(element) {
    this.front--;
    this.items[this.front] = element;
  }
  
  addRear(element) {
    this.items[this.rear] = element;
    this.rear++;
  }
}

Sorted insertion
Random access
Bidirectional insertion
Deque enables bidirectional operations because: 1) Allows insertion at both front and rear, 2) Maintains efficiency for both ends, 3) Combines stack and queue capabilities, 4) Uses object for optimal memory management, 5) Supports negative indexing for front operations, 6) Enables flexible data access patterns, 7) Useful for complex algorithms requiring both FIFO and LIFO, 8) Common in parsing and algorithm implementations.
Priority ordering

Next Question (10/20)