Why Enqueue Using Linked List in DSA Typescript?

The Big Idea

What if adding to a line could be as simple as linking hands?

The Scenario

Imagine you have a long line of people waiting to buy tickets. You try to remember everyone's name and order by writing them down on a piece of paper. Every time a new person arrives, you have to find the end of the list and add their name manually.

The Problem

This manual method is slow and confusing. You might lose track of the order, forget names, or accidentally add someone in the wrong place. It becomes hard to keep the list organized as more people join.

The Solution

Using a linked list to enqueue means you keep a simple chain where each person points to the next. Adding a new person is easy: just link them at the end. This keeps the order correct and makes adding fast and error-free.

Before vs After

✗ Before

let queue = [];
// To add a person
queue.push('Alice');
queue.push('Bob');

✓ After

class Node {
  value: string;
  next: Node | null = null;
  constructor(value: string) { this.value = value; }
}

class Queue {
  head: Node | null = null;
  tail: Node | null = null;
  enqueue(value: string) {
    const newNode = new Node(value);
    if (!this.tail) {
      this.head = newNode;
      this.tail = newNode;
    } else {
      this.tail.next = newNode;
      this.tail = newNode;
    }
  }
}

What It Enables

This lets you add items quickly and keep the order perfectly, even when the list grows very long.

Real Life Example

Think of a printer queue where documents wait their turn. Using a linked list to enqueue documents ensures each new print job is added at the end without disturbing the order.

Key Takeaways

Manual lists get messy and slow as they grow.

Linked lists let you add items easily at the end.

Enqueue with linked lists keeps order and speed.

Practice

1. What does the enqueue operation do in a linked list implementation of a queue?

easy

A. Removes the first element from the linked list

B. Adds a new element at the end (tail) of the linked list

C. Adds a new element at the beginning (head) of the linked list

D. Deletes the last element from the linked list

Solution

1. Step 1: Understand enqueue operation

   Enqueue means adding an element to the queue.

2. Step 2: Identify linked list position for enqueue

   In a linked list queue, new elements are added at the tail (end).

3. Final Answer:

   Adds a new element at the end (tail) of the linked list -> Option B

4. Quick Check:

   Enqueue = Add at tail [OK]

Hint: Enqueue always adds at the tail in linked list queue [OK]

Common Mistakes:

• Confusing enqueue with dequeue operation
• Adding new element at head instead of tail
• Thinking enqueue removes elements
• Mixing linked list positions

2. Which of the following is the correct TypeScript syntax to create a new node for enqueue in a linked list?

easy

A. newNode = new Node();

B. let newNode = Node(value);

C. const newNode = new Node(value);

D. const newNode = Node.new(value);

Solution

1. Step 1: Recall TypeScript class instantiation

   To create an object, use new ClassName(params).

2. Step 2: Check options for correct syntax

   Only const newNode = new Node(value); correctly creates a new Node instance.

3. Final Answer:

   const newNode = new Node(value); -> Option C

4. Quick Check:

   Use 'new' keyword to instantiate class [OK]

Hint: Use 'new' keyword to create class instances in TypeScript [OK]

Common Mistakes:

• Omitting 'new' keyword when creating objects
• Using function call syntax without 'new'
• Incorrect property access like Node.new
• Not declaring variable with let or const

3. What will be the state of the queue after executing the following enqueue operations on an empty linked list queue?

enqueue(10); enqueue(20); enqueue(30);

medium

A. 10 -> 20 -> 30 -> null

B. 30 -> 20 -> 10 -> null

C. null -> 10 -> 20 -> 30

D. 20 -> 10 -> 30 -> null

Solution

1. Step 1: Understand enqueue order

   Enqueue adds elements at the tail, so order is preserved as inserted.

2. Step 2: Trace each enqueue

   After enqueue(10): 10 -> null
   After enqueue(20): 10 -> 20 -> null
   After enqueue(30): 10 -> 20 -> 30 -> null

3. Final Answer:

   10 -> 20 -> 30 -> null -> Option A

4. Quick Check:

   Enqueue order = insertion order [OK]

Hint: Enqueue adds at tail, so order stays same as insertion [OK]

Common Mistakes:

• Reversing order of elements after enqueue
• Confusing enqueue with push at head
• Misreading linked list direction
• Ignoring null at the end

4. Consider this enqueue function snippet for a linked list queue:

enqueue(value: number) {
  const newNode = new Node(value);
  if (!this.tail) {
    this.head = newNode;
    this.tail = newNode;
    return;
  }
  this.tail.next = newNode;
  this.tail = newNode;
}

What is the bug in this code?

medium

A. It does not update the previous tail's next pointer to newNode

B. It incorrectly sets head to null when queue is empty

C. It creates newNode without value

D. It sets tail to null after enqueue

Solution

1. Step 1: Analyze enqueue logic

   When queue is empty, head and tail should point to newNode.

2. Step 2: Check linking of nodes

   Code sets tail = newNode but does not link old tail's next to newNode, breaking chain.

3. Final Answer:

   It does not update the previous tail's next pointer to newNode -> Option A

4. Quick Check:

   Link old tail's next to newNode [OK]

Hint: Always link old tail's next to new node when enqueueing [OK]

Common Mistakes:

• Forgetting to update old tail's next pointer
• Not handling empty queue case properly
• Setting tail to null accidentally
• Creating node without value parameter

5. You have a linked list queue with elements: 5 -> 15 -> 25 -> null.
After enqueue(35), what will be the correct linked list representation and tail node value?

hard

A. 5 -> 15 -> 25 -> 35 -> null, tail value = 25

B. 35 -> 5 -> 15 -> 25 -> null, tail value = 25

C. 5 -> 15 -> 25 -> null, tail value = 25

D. 5 -> 15 -> 25 -> 35 -> null, tail value = 35

Solution

1. Step 1: Understand enqueue effect on queue

   Enqueue adds new element at tail, so 35 goes after 25.

2. Step 2: Update tail pointer

   Tail must point to the new last node, which holds 35.

3. Final Answer:

   5 -> 15 -> 25 -> 35 -> null, tail value = 35 -> Option D

4. Quick Check:

   Enqueue adds at tail, tail updates to new node [OK]

Hint: Tail always points to last enqueued node [OK]

Common Mistakes:

• Adding new node at head instead of tail
• Not updating tail pointer after enqueue
• Confusing tail value with head value
• Leaving tail pointing to old last node