Linked List vs Array When to Choose Which in DSA Javascript - Complexity Comparison

Time Complexity: Linked List vs Array When to Choose Which

O(1) for array access, O(n) for linked list access

Understanding Time Complexity

Choosing between a linked list and an array depends on how fast operations run as data grows.

We want to know which data structure handles adding, removing, and accessing items better as the list gets bigger.

Scenario Under Consideration

Analyze the time complexity of basic operations on arrays and linked lists.

// Array operations
const arr = [];
arr.push(10);          // Add at end
arr.unshift(5);        // Add at start
const val = arr[1];    // Access by index

// Linked List operations
class Node {
  constructor(value) {
    this.value = value;
    this.next = null;
  }
}
// Assume linked list with head pointer
// Adding at start: O(1)
// Access by index: O(n)
    

This code shows adding and accessing elements in arrays and linked lists.

Identify Repeating Operations

Look at what repeats when we do operations on these structures.

• Primary operation: Accessing elements by index in array vs traversing nodes in linked list.
• How many times: Array access is direct (once), linked list access requires walking through nodes up to n times.

How Execution Grows With Input

As the list size grows, accessing an element in an array stays fast, but in a linked list it gets slower.

Input Size (n)	Array Access Steps	Linked List Access Steps
10	1	Up to 10
100	1	Up to 100
1000	1	Up to 1000

Pattern observation: Array access time stays the same no matter how big, linked list access time grows linearly with size.

Final Time Complexity

Time Complexity: O(1) for array access, O(n) for linked list access

This means arrays let you get any item instantly, but linked lists need to check each item one by one.

Common Mistake

[X] Wrong: "Linked lists are always faster because they use pointers."

[OK] Correct: Linked lists are faster only for adding/removing at start or middle without shifting, but accessing items by position is slower than arrays.

Interview Connect

Understanding these differences helps you pick the right data structure for the job and explain your choice clearly in interviews.

Self-Check

"What if we used a doubly linked list instead of a singly linked list? How would the time complexity for adding or removing elements change?"

Practice

1. Which data structure is generally better for frequent insertions and deletions in the middle of the collection?

easy

A. Array

B. Neither is suitable

C. Both are equally efficient

D. Linked List

Solution

1. Step 1: Understand insertion and deletion costs in arrays

   Arrays require shifting elements when inserting or deleting in the middle, which is costly.

2. Step 2: Understand linked list insertion and deletion

   Linked lists can insert or delete nodes by changing pointers without shifting elements.

3. Final Answer:

   Linked List -> Option D

4. Quick Check:

   Insert/delete middle = Linked List [OK]

Hint: Choose linked list for fast middle insert/delete [OK]

Common Mistakes:

• Thinking arrays handle middle insertions efficiently
• Confusing array resizing with insertion cost
• Assuming linked lists have faster access

2. Which of the following is the correct way to declare an empty linked list node in JavaScript?

easy

A. const node = { value: null, next: null };

B. const node = [null, null];

C. const node = null;

D. const node = new Array();

Solution

1. Step 1: Understand linked list node structure

   A linked list node typically has a value and a pointer to the next node, represented as an object with 'value' and 'next' properties.

2. Step 2: Check each option

   const node = { value: null, next: null }; correctly creates an object with 'value' and 'next' set to null. Others do not represent a linked list node properly.

3. Final Answer:

   const node = { value: null, next: null }; -> Option A

4. Quick Check:

   Linked list node = object with value and next [OK]

Hint: Linked list nodes are objects with value and next [OK]

Common Mistakes:

• Using arrays instead of objects for nodes
• Assigning null directly without properties
• Confusing array declaration with node

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

const arr = [1, 2, 3];
arr.splice(1, 1, 4);
console.log(arr);

medium

A. [1, 4, 3]

B. [1, 2, 3]

C. [4, 2, 3]

D. [1, 3]

Solution

1. Step 1: Understand splice parameters

   arr.splice(1, 1, 4) means start at index 1, remove 1 element, then insert 4 at that position.

2. Step 2: Apply splice to array

   Original array is [1, 2, 3]. Removing element at index 1 (which is 2) and inserting 4 results in [1, 4, 3].

3. Final Answer:

   [1, 4, 3] -> Option A

4. Quick Check:

   splice replaces element at index 1 with 4 [OK]

Hint: splice(start, deleteCount, item) replaces elements [OK]

Common Mistakes:

• Thinking splice inserts without deleting
• Confusing splice with slice
• Expecting original array unchanged

4. Identify the error in the following linked list insertion code snippet:

function insertAtHead(head, value) {
  const newNode = { value: value, next: head };
  head = newNode;
  return head;
}

let head = null;
insertAtHead(head, 5);
console.log(head);

medium

A. newNode is not created correctly

B. The head variable is not updated outside the function

C. The function should not return head

D. The next pointer should be null

Solution

1. Step 1: Understand variable scope in JavaScript

   Inside the function, head is a local parameter. Assigning head = newNode changes only local copy.

2. Step 2: Check effect on external head variable

   Outside the function, head remains null because the updated head inside the function is not reflected outside.

3. Final Answer:

   The head variable is not updated outside the function -> Option B

4. Quick Check:

   Function parameter reassignment doesn't affect external variable [OK]

Hint: Return and assign new head to update linked list [OK]

Common Mistakes:

• Assuming head changes globally without return
• Not returning the new head
• Misunderstanding pointer assignment

5. You need to store a large collection of items where you frequently add elements at the end and access elements by index quickly. Which data structure should you choose and why?

hard

A. Linked List, because it allows fast access by index

B. Linked List, because it uses less memory than arrays

C. Array, because it allows fast access by index and efficient append

D. Array, because it allows fast insertion and deletion in the middle

Solution

1. Step 1: Analyze access by index requirement

   Arrays provide constant time access by index, linked lists require traversal which is slower.

2. Step 2: Analyze frequent append requirement

   Arrays can append efficiently if capacity allows; linked lists also append efficiently but slower access is a drawback.

3. Final Answer:

   Array, because it allows fast access by index and efficient append -> Option C

4. Quick Check:

   Fast index access + append = Array [OK]

Hint: Use array for fast index access and appending [OK]

Common Mistakes:

• Choosing linked list for fast index access
• Assuming linked list uses less memory always
• Confusing insertion in middle with append