Implementing Stacks & Queues

What data structure is being simulated using two stacks?

class Stack {
  constructor() {
    this.stack1 = [];
    this.stack2 = [];
  }
  
  enqueue(element) {
    while (this.stack1.length) {
      this.stack2.push(this.stack1.pop());
    }
    this.stack1.push(element);
    while (this.stack2.length) {
      this.stack1.push(this.stack2.pop());
    }
  }
  
  dequeue() {
    return this.stack1.pop();
  }
}

Priority Queue
Circular Buffer
Regular Queue
This implements a queue using two stacks by: 1) Using stack operations to maintain FIFO order, 2) Reversing elements during enqueue to maintain order, 3) Achieving queue behavior with stack primitives, 4) Demonstrating data structure adaptability, 5) Trading space for implementation simplicity, 6) Useful for systems with stack-only primitives, 7) Shows relationship between linear data structures, 8) Common interview problem solution.
Deque

Next Question (9/20)