Why Linked List Exists and What Problem It Solves in DSA Javascript - See It Work

Why Linked List Exists and What Problem It Solves

📖 Scenario: Imagine you are organizing a photo album where you want to add and remove photos easily without shifting all the others. Using a simple list (array) can be slow when you add or remove photos in the middle because you have to move many photos around. A linked list helps solve this problem by connecting photos with links, so you can add or remove photos quickly without moving others.

🎯 Goal: You will create a simple linked list in JavaScript to understand why linked lists exist and how they solve the problem of slow insertions and deletions in arrays.

📋 What You'll Learn

Create a linked list node structure with a value and a pointer to the next node

Create a linked list with three nodes connected

Add a variable to hold the head (start) of the linked list

Traverse the linked list and collect values to show the order of nodes

💡 Why This Matters

🌍 Real World

Linked lists are used in music players to keep track of songs in a playlist where songs can be added or removed easily.

💼 Career

Understanding linked lists is important for software developers to manage data efficiently and solve problems involving dynamic data.

1

Create three linked list nodes

Create three variables called node1, node2, and node3. Each should be an object with a value property set to 10, 20, and 30 respectively, and a next property set to null.

DSA Javascript

# Your code here

Hint

Each node is an object with two properties: value and next. Start by creating these objects with next set to null.

2

Link the nodes together

Set the next property of node1 to node2, and the next property of node2 to node3. Leave node3.next as null.

DSA Javascript

const node1 = { value: 10, next: null };
const node2 = { value: 20, next: null };
const node3 = { value: 30, next: null };
// Your code here

Hint

Link nodes by setting the next property of one node to point to the next node.

3

Create a head pointer for the linked list

Create a variable called head and set it to node1. This will represent the start of the linked list.

DSA Javascript

const node1 = { value: 10, next: null };
const node2 = { value: 20, next: null };
const node3 = { value: 30, next: null };

node1.next = node2;
node2.next = node3;
// Your code here

Hint

The head variable points to the first node in the linked list.

4

Traverse and print the linked list values

Create a variable called current and set it to head. Use a while loop to traverse the linked list until current is null. Inside the loop, print the value of current followed by ' -> '. After the loop, print 'null' to show the end of the list.

DSA Javascript

const node1 = { value: 10, next: null };
const node2 = { value: 20, next: null };
const node3 = { value: 30, next: null };

node1.next = node2;
node2.next = node3;

const head = node1;
// Your code here

Hint

Use a while loop to move through each node until you reach the end (null), printing values along the way.

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