What is the difference between a deque and a queue in JavaScript?

What is the difference between a deque and a queue in JavaScript?

A queue is a linear data structure that follows the First In First Out (FIFO) principle, while a deque (double-ended queue) allows insertion and deletion from both ends.

Can you give me an example of how to implement both in JavaScript?

Sure! Here's a simple implementation:

// Queue implementation class Queue { constructor() { this.items = []; } enqueue(element) { this.items.push(element); } dequeue() { return this.items.shift(); } }

// Deque implementation class Deque { constructor() { this.items = []; } addFront(element) { this.items.unshift(element); } addRear(element) { this.items.push(element); } removeFront() { return this.items.shift(); } removeRear() { return this.items.pop(); } }