Why Dequeue Using Linked List in DSA Javascript?

The Big Idea

What if you could manage a line that changes from both ends without any hassle or delay?

The Scenario

Imagine you have a line of people waiting to buy tickets, but sometimes people join at the front and sometimes at the back. If you try to manage this line by writing down names on paper and moving them around manually, it quickly becomes confusing and slow.

The Problem

Using a simple list or array to add or remove people from both ends means shifting many names every time someone joins or leaves at the front. This is slow and easy to mess up, especially when the line is long.

The Solution

A dequeue (double-ended queue) using a linked list lets you add or remove people from both ends quickly without moving others. Each person knows who is next and who is before, so you just update a few links, making the process fast and simple.

Before vs After

✗ Before

let line = [];
line.unshift('Alice'); // add at front
line.push('Bob');    // add at back
line.shift();        // remove from front

✓ After

class Node {
  constructor(value) {
    this.value = value;
    this.next = null;
    this.prev = null;
  }
}
// Deque class with addFront, addRear, removeFront, removeRear methods

What It Enables

This lets you efficiently manage lines or tasks where you need to add or remove items from both ends without delays or errors.

Real Life Example

Think of a train station platform where passengers can enter or exit from either end of the train cars quickly and smoothly, without crowding or confusion.

Key Takeaways

Manual methods are slow and error-prone for double-ended operations.

Deque with linked list allows fast add/remove at both ends.

It keeps operations simple and efficient even with many elements.

Practice

1. What is the main advantage of using a linked list to implement a dequeue compared to an array?

easy

A. It automatically sorts the elements as they are inserted.

B. It allows efficient insertion and deletion from both ends without shifting elements.

C. It uses less memory than an array for the same number of elements.

D. It prevents duplicate elements from being added.

Solution

1. Step 1: Understand linked list operations

   A linked list allows adding or removing nodes at the front or back in constant time without moving other elements.

2. Step 2: Compare with array behavior

   Arrays require shifting elements when inserting or deleting at the front, which is less efficient.

3. Final Answer:

   It allows efficient insertion and deletion from both ends without shifting elements. -> Option B

4. Quick Check:

   Linked list = efficient ends operations [OK]

Hint: Linked list avoids shifting elements for front/back operations [OK]

Common Mistakes:

• Thinking arrays are always more memory efficient
• Assuming linked list sorts elements automatically
• Believing linked list prevents duplicates

2. Which of the following is the correct way to add a new node at the front of a dequeue implemented using a linked list in JavaScript?

easy

A. Create new node, set its prev to current tail, update tail to new node.

B. Create new node, set its prev to current head, update head to new node.

C. Create new node, set its next to null, update tail to new node.

D. Create new node, set its next to current head, update head to new node.

Solution

1. Step 1: Understand adding at front in linked list

   To add at front, new node's next points to current head, then head updates to new node.

2. Step 2: Check options for correctness

   Create new node, set its next to current head, update head to new node. matches this logic; others incorrectly use prev or tail.

3. Final Answer:

   Create new node, set its next to current head, update head to new node. -> Option D

4. Quick Check:

   Add front = newNode.next = head; head = newNode [OK]

Hint: New front node points next to old head [OK]

Common Mistakes:

• Confusing prev and next pointers
• Updating tail instead of head when adding front
• Setting next to null incorrectly

3. Consider the following JavaScript code for a dequeue using a doubly linked list:

class Node {
  constructor(value) {
    this.value = value;
    this.next = null;
    this.prev = null;
  }
}

class Dequeue {
  constructor() {
    this.head = null;
    this.tail = null;
  }

  addFront(value) {
    const newNode = new Node(value);
    if (!this.head) {
      this.head = this.tail = newNode;
    } else {
      newNode.next = this.head;
      this.head.prev = newNode;
      this.head = newNode;
    }
  }

  addRear(value) {
    const newNode = new Node(value);
    if (!this.tail) {
      this.head = this.tail = newNode;
    } else {
      this.tail.next = newNode;
      newNode.prev = this.tail;
      this.tail = newNode;
    }
  }

  removeFront() {
    if (!this.head) return null;
    const val = this.head.value;
    this.head = this.head.next;
    if (this.head) this.head.prev = null;
    else this.tail = null;
    return val;
  }
}

const dq = new Dequeue();
dq.addRear(10);
dq.addFront(20);
dq.addRear(30);
const removed = dq.removeFront();
console.log(removed);
console.log(dq.head.value + ' -> ' + dq.tail.value);

What will be the output?

medium

A. 10
20 -> 30

B. 20
30 -> 10

C. 20
10 -> 30

D. 10
30 -> 20

Solution

1. Step 1: Trace insertions

   addRear(10): list is 10 addFront(20): list is 20 -> 10 addRear(30): list is 20 -> 10 -> 30

2. Step 2: Trace removal

   removeFront() removes 20, returns 20. List becomes 10 -> 30.

3. Final Answer:

   20 10 -> 30 -> Option C

4. Quick Check:

   Remove front returns 20; list head=10, tail=30 [OK]

Hint: Track head/tail changes step-by-step [OK]

Common Mistakes:

• Confusing addFront and addRear order
• Forgetting to update prev pointers
• Mixing removed value with current head

4. The following code snippet is intended to remove the rear node from a dequeue implemented using a doubly linked list. What is the error?

removeRear() {
  if (!this.tail) return null;
  const val = this.tail.value;
  this.tail = this.tail.prev;
  this.tail.next = null;
  return val;
}

medium

A. It does not handle the case when the list becomes empty after removal.

B. It incorrectly updates the head pointer instead of tail.

C. It should set this.tail.prev to null instead of this.tail.next.

D. It returns the wrong value after removal.

Solution

1. Step 1: Analyze removal logic

   After setting tail to tail.prev, if tail becomes null (list empty), accessing tail.next causes error.

2. Step 2: Identify missing check

   Code must check if tail is null before setting tail.next = null to avoid runtime error.

3. Final Answer:

   It does not handle the case when the list becomes empty after removal. -> Option A

4. Quick Check:

   Check empty list after removal to avoid null pointer [OK]

Hint: Check for empty list before pointer updates [OK]

Common Mistakes:

• Not checking if tail is null after update
• Confusing head and tail pointers
• Setting wrong pointer to null

5. You want to implement a function reverseDequeue() that reverses the order of nodes in a dequeue implemented using a doubly linked list. Which approach correctly reverses the dequeue?

hard

A. Traverse each node, swap its next and prev pointers, then swap head and tail pointers.

B. Traverse each node, set next to null, and prev to head, then update head to tail.

C. Create a new dequeue and addRear nodes from the original dequeue's front to rear.

D. Swap values of head and tail nodes only.

Solution

1. Step 1: Understand reversal in doubly linked list

   Reversing means each node's next and prev pointers must be swapped to reverse direction.

2. Step 2: Update head and tail pointers

   After swapping pointers in all nodes, head and tail pointers must be swapped to reflect new ends.

3. Final Answer:

   Traverse each node, swap its next and prev pointers, then swap head and tail pointers. -> Option A

4. Quick Check:

   Swap next/prev in nodes + swap head/tail [OK]

Hint: Swap next and prev pointers in all nodes [OK]

Common Mistakes:

• Only swapping head and tail values
• Setting next to null incorrectly
• Creating new dequeue instead of reversing in place