Why Linked List Exists and What Problem It Solves in DSA Javascript - Why This Pattern

Mental Model

A linked list stores items in nodes connected by pointers, so you can add or remove items easily without moving everything.

Analogy: Imagine a treasure hunt where each clue points to the next location. You only need to follow the clues one by one, not carry all locations at once.

Head -> [1] -> [2] -> [3] -> null

Dry Run Walkthrough

Input: array: [1, 2, 3], insert 4 at start

Goal: Show how linked list lets us add 4 at the start without moving other items

Step 1: Create new node with value 4

NewNode[4] null

Why: We need a new node to hold the new value

Step 2: Point new node's next to current head (node 1)

NewNode[4] -> [1] -> [2] -> [3] -> null

Why: Link new node to the existing list so it connects properly

Step 3: Update head to new node

Head -> [4] -> [1] -> [2] -> [3] -> null

Why: Make new node the first item without moving other nodes

Result:

Head -> [4] -> [1] -> [2] -> [3] -> null

Annotated Code

DSA Javascript

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

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

  insertAtStart(value) {
    const newNode = new Node(value); // create new node
    newNode.next = this.head; // link new node to current head
    this.head = newNode; // update head to new node
  }

  printList() {
    let curr = this.head;
    let result = '';
    while (curr) {
      result += curr.value + ' -> ';
      curr = curr.next;
    }
    result += 'null';
    console.log(result);
  }
}

// Driver code
const list = new LinkedList();
list.insertAtStart(1);
list.insertAtStart(2);
list.insertAtStart(3);
list.printList(); // prints 3 -> 2 -> 1 -> null

list.insertAtStart(4);
list.printList(); // prints 4 -> 3 -> 2 -> 1 -> null

const newNode = new Node(value); // create new node

create new node to hold the new value

newNode.next = this.head; // link new node to current head

point new node's next to current head to connect list

this.head = newNode; // update head to new node

update head pointer to new node to insert at start

Output

3 -> 2 -> 1 -> null

4 -> 3 -> 2 -> 1 -> null

Complexity Analysis

Time: O(1) because inserting at the start only changes a few pointers without traversing the list

Space: O(1) because only one new node is created regardless of list size

vs Alternative: Compared to arrays where inserting at start requires shifting all elements (O(n)), linked lists insert quickly without moving existing data

Edge Cases

empty list

new node becomes the head with next pointing to null

DSA Javascript

newNode.next = this.head; // link new node to current head

single element list

new node points to the single existing node, becomes new head

DSA Javascript

this.head = newNode; // update head to new node

When to Use This Pattern

When you need to add or remove items quickly at the start or middle without moving many elements, think of linked lists because they use pointers to connect nodes.

Common Mistakes

Mistake: Forgetting to update the head pointer after inserting a new node
Fix: Always assign the new node to head after linking it to the old head

Mistake: Not linking the new node's next to the current head, breaking the list
Fix: Set newNode.next = this.head before updating head

Summary

Linked list stores items in nodes connected by pointers allowing easy insertion and deletion.

Use linked lists when you want fast insertions or deletions without shifting many elements.

The key is that each node points to the next, so you only change pointers, not move data.

Practice

1. Why do we use a linked list instead of an array in some cases?

easy

A. Because linked lists allow easy insertion and deletion without shifting elements

B. Because linked lists use less memory than arrays always

C. Because linked lists store data in contiguous memory locations

D. Because linked lists are faster for accessing elements by index

Solution

1. Step 1: Understand array limitations

   Arrays store elements in contiguous memory, so inserting or deleting in the middle requires shifting elements, which is slow.

2. Step 2: Understand linked list advantages

   Linked lists store elements in nodes linked by pointers, so insertion and deletion can be done by changing pointers without shifting.

3. Final Answer:

   Because linked lists allow easy insertion and deletion without shifting elements -> Option A

4. Quick Check:

   Insertion/deletion ease = B [OK]

Hint: Linked lists excel at insert/delete without moving all elements [OK]

Common Mistakes:

• Thinking linked lists always use less memory
• Believing linked lists store data contiguously
• Assuming linked lists have fast random access

2. Which of the following is the correct way to define a node in a singly linked list in JavaScript?

easy

A. function Node(value) { this.next = value; this.value = null; }

B. function Node(value) { this.value = value; this.prev = null; }

C. function Node(value) { this.value = null; this.next = value; }

D. function Node(value) { this.value = value; this.next = null; }

Solution

1. Step 1: Identify node properties for singly linked list

   A node should store its value and a pointer to the next node, usually called 'next'.

2. Step 2: Check each option's correctness

   function Node(value) { this.value = value; this.next = null; } correctly assigns value and sets next to null initially. Options A, B, and D misuse 'prev' or swap value and next.

3. Final Answer:

   function Node(value) { this.value = value; this.next = null; } -> Option D

4. Quick Check:

   Node with value and next = C [OK]

Hint: Node must have value and next pointer for singly linked list [OK]

Common Mistakes:

• Using 'prev' instead of 'next' for singly linked list
• Swapping value and next assignments
• Not initializing next to null

3. What will be the output of the following code snippet?

function Node(value) {
  this.value = value;
  this.next = null;
}

const head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);

let current = head;
let result = '';
while(current) {
  result += current.value + ' -> ';
  current = current.next;
}
result += 'null';
console.log(result);

medium

A. 1 -> 2 -> 3 -> null

B. 1 -> 2 -> null

C. null -> 1 -> 2 -> 3

D. 3 -> 2 -> 1 -> null

Solution

1. Step 1: Build the linked list nodes

   Nodes with values 1, 2, and 3 are created and linked: head -> 1 -> 2 -> 3 -> null.

2. Step 2: Traverse and build output string

   The while loop appends each node's value followed by ' -> ' until current is null, then adds 'null'.

3. Final Answer:

   1 -> 2 -> 3 -> null -> Option A

4. Quick Check:

   Traverse nodes 1,2,3 then null = A [OK]

Hint: Traverse nodes from head, append values with arrows, end with null [OK]

Common Mistakes:

• Stopping traversal too early
• Appending 'null' at start instead of end
• Reversing node order in output

4. The following code tries to insert a new node with value 4 after the head node in a linked list. What is the error?

function Node(value) {
  this.value = value;
  this.next = null;
}

const head = new Node(1);
head.next = new Node(2);

const newNode = new Node(4);
newNode.next = head.next;
head = newNode;

medium

A. newNode.next should be null instead of head.next

B. Cannot assign to 'head' because it is a constant

C. Missing function to insert node

D. Node constructor is incorrect

Solution

1. Step 1: Identify variable declaration

   head is declared with const, so it cannot be reassigned to a new value.

2. Step 2: Check the reassignment line

   The line 'head = newNode;' tries to assign a new object to head, causing an error.

3. Final Answer:

   Cannot assign to 'head' because it is a constant -> Option B

4. Quick Check:

   Reassigning const variable = A [OK]

Hint: const variables cannot be reassigned after declaration [OK]

Common Mistakes:

• Thinking newNode.next should be null
• Assuming missing insert function causes error
• Believing Node constructor is wrong

5. You want to implement a playlist where songs can be added or removed anywhere efficiently. Which data structure best solves this problem and why?

hard

A. Array, because it allows fast random access to songs

B. Queue, because it follows first-in-first-out order

C. Linked list, because it allows efficient insertions and deletions anywhere

D. Stack, because it follows last-in-first-out order

Solution

1. Step 1: Understand playlist operations

   Adding or removing songs anywhere means insertions and deletions at arbitrary positions.

2. Step 2: Compare data structures

   Arrays have slow insert/delete in middle due to shifting. Stacks and queues have restricted access order. Linked lists allow efficient insert/delete by changing pointers.

3. Final Answer:

   Linked list, because it allows efficient insertions and deletions anywhere -> Option C

4. Quick Check:

   Efficient insert/delete anywhere = D [OK]

Hint: Use linked list for efficient insert/delete anywhere [OK]

Common Mistakes:

• Choosing array for fast random access but ignoring insert/delete cost
• Confusing stack or queue with general insert/delete needs
• Ignoring linked list pointer advantages