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

Mental Model

A linked list lets us add or remove items easily without moving everything else.

Analogy: Imagine a treasure hunt where each clue points to the next one. You only need to follow the clues, not rearrange all of them when adding a new clue.

Array: [1][2][3][4][5]
Linked List: 1 -> 2 -> 3 -> 4 -> 5 -> null

Dry Run Walkthrough

Input: Array: [1, 2, 3], Insert 0 at start

Goal: Show how adding at start is easy in linked list but hard in array

Step 1: Try to insert 0 at start of array

[1][2][3] (array before insertion)

Why: Array needs to shift all elements to make space

Step 2: Shift elements right to make space

[ ][1][2][3] (array after shifting)

Why: We must move all elements one step right to insert at start

Step 3: Place 0 at start

[0][1][2][3] (array after insertion)

Why: Insertion done but costly because of shifting

Step 4: Insert 0 at start of linked list

0 -> 1 -> 2 -> 3 -> null (linked list after insertion)

Why: Just change one pointer to add new node at start

Result:

Array after insertion: [0][1][2][3]
Linked List after insertion: 0 -> 1 -> 2 -> 3 -> null

Annotated Code

DSA C#

using System;

class Node {
    public int data;
    public Node next;
    public Node(int data) {
        this.data = data;
        this.next = null;
    }
}

class LinkedList {
    public Node head;

    public void InsertAtStart(int value) {
        Node newNode = new Node(value);
        newNode.next = head; // connect new node to current first node
        head = newNode; // make new node the first node
    }

    public void PrintList() {
        Node current = head;
        while (current != null) {
            Console.Write(current.data + " -> ");
            current = current.next; // advance pointer to next node for printing
        }
        Console.WriteLine("null");
    }
}

class Program {
    static void Main() {
        // Array insertion simulation
        int[] arr = {1, 2, 3};
        int[] newArr = new int[arr.Length + 1];
        // shift elements right
        for (int i = arr.Length - 1; i >= 0; i--) {
            newArr[i + 1] = arr[i]; // shift all array elements right to make space at start
        }
        newArr[0] = 0; // insert at start
        Console.WriteLine("Array after insertion:");
        foreach (int val in newArr) {
            Console.Write("[" + val + "]");
        }
        Console.WriteLine();

        // Linked list insertion
        LinkedList list = new LinkedList();
        list.head = new Node(1);
        list.head.next = new Node(2);
        list.head.next.next = new Node(3);

        list.InsertAtStart(0);
        Console.WriteLine("Linked List after insertion:");
        list.PrintList();
    }
}

newNode.next = head; // connect new node to current first node

connect new node to current first node

head = newNode; // make new node the first node

make new node the first node

for (int i = arr.Length - 1; i >= 0; i--) { newArr[i + 1] = arr[i]; // shift all array elements right to make space at start }

shift all array elements right to make space at start

current = current.next; // advance pointer to next node for printing

advance pointer to next node for printing

Output

Array after insertion:

[0][1][2][3]

Linked List after insertion:

0 -> 1 -> 2 -> 3 -> null

Complexity Analysis

Time: O(n) for array insertion at start because all elements must shift; O(1) for linked list insertion because only pointers change

Space: O(n) for new array copy during insertion; O(1) extra space for linked list insertion

vs Alternative: Linked list insertion is faster and uses less work than array shifting when adding/removing at start

Edge Cases

Empty linked list

Insertion at start sets head to new node without issues

DSA C#

head = newNode; // update head to new node

Array with zero elements

New array created with one element inserted at start

DSA C#

int[] newArr = new int[arr.Length + 1];

When to Use This Pattern

When you need to add or remove items at the start or middle often and want to avoid moving many elements, think of linked lists because they let you change pointers instead of shifting data.

Common Mistakes

Mistake: Trying to insert at start of array without shifting elements
Fix: Shift all elements right by one position before inserting

Mistake: Not updating head pointer after inserting new node in linked list
Fix: Always set head to new node after insertion at start

Summary

Linked list exists to allow easy insertion and deletion without moving all elements.

Use linked lists when you need fast insertions or deletions at the start or middle of a list.

The key insight is that linked lists use pointers to connect nodes, so you only change links, not move data.

Practice

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

easy

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

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

C. Because linked lists store elements in contiguous memory locations

D. Because linked lists use less memory than arrays always

Solution

1. Step 1: Understand array limitations

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

2. Step 2: Understand linked list advantage

   Linked lists store elements in nodes connected 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 B

4. Quick Check:

   Insertion/deletion ease = D [OK]

Hint: Linked lists excel at insert/delete without shifting [OK]

Common Mistakes:

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

2. Which of the following is the correct way to declare a node class for a singly linked list in C#?

easy

A. public class Node { int data; int next; }

B. class Node { public int data; public int next; }

C. public class Node { public int data; public Node next; }

D. public class Node { public int data; public Node previous; }

Solution

1. Step 1: Check node data types

   A node should store data and a reference to the next node, so data is int and next is Node type.

2. Step 2: Validate options

   public class Node { public int data; public Node next; } correctly declares data as int and next as Node. public class Node { int data; int next; } uses int for next which is wrong. class Node { public int data; public int next; } misses public for class and next is int. public class Node { public int data; public Node previous; } uses previous which is for doubly linked list, not singly.

3. Final Answer:

   public class Node { public int data; public Node next; } -> Option C

4. Quick Check:

   Node with int data and Node next = B [OK]

Hint: Node next must be Node type, not int [OK]

Common Mistakes:

• Using int type for next pointer
• Missing public access modifier
• Confusing singly and doubly linked list node

3. What will be the output of the following C# code that creates a linked list and prints its elements?

class Node {
  public int data;
  public Node next;
  public Node(int d) { data = d; next = null; }
}

class Program {
  static void Main() {
    Node head = new Node(10);
    head.next = new Node(20);
    head.next.next = new Node(30);

    Node current = head;
    while (current != null) {
      Console.Write(current.data + " -> ");
      current = current.next;
    }
    Console.WriteLine("null");
  }
}

medium

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

B. 10 -> 20 -> null

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

D. Compilation error

Solution

1. Step 1: Build linked list nodes

   Nodes created with data 10, 20, 30 linked in order: 10 -> 20 -> 30.

2. Step 2: Traverse and print nodes

   Loop prints each node's data followed by ' -> ', ending with 'null'. Output is 10 -> 20 -> 30 -> null.

3. Final Answer:

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

4. Quick Check:

   Traverse linked list prints nodes in order [OK]

Hint: Traverse from head, print data until null [OK]

Common Mistakes:

• Printing nodes in reverse order
• Missing last node in output
• Confusing next pointer usage

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

Node head = new Node(10);
head.next = new Node(20);
Node newNode = new Node(15);
newNode.next = head.next;
head.next = newNode.next;

medium

A. head should be null before insertion

B. newNode.next should be null

C. No error, code works fine

D. head.next is assigned incorrectly, losing the new node

Solution

1. Step 1: Analyze pointer assignments

   newNode.next is set to head.next (which is node with 20), correct for insertion.

2. Step 2: Check head.next assignment

   head.next is set to newNode.next, which points to node 20, so newNode is skipped and lost.

3. Final Answer:

   head.next is assigned incorrectly, losing the new node -> Option D

4. Quick Check:

   head.next must point to newNode, not newNode.next [OK]

Hint: head.next should point to newNode, not newNode.next [OK]

Common Mistakes:

• Assigning head.next to newNode.next instead of newNode
• Setting newNode.next to null incorrectly
• Not updating pointers in correct order

5. You want to implement a playlist where songs can be added or removed frequently at any position. Why is a linked list a better choice than an array for this use case?

hard

A. Because linked lists allow dynamic memory allocation and efficient insertions/removals anywhere

B. Because arrays automatically resize and are faster for insertions

C. Because linked lists store elements contiguously for faster access

D. Because arrays use pointers to link elements like linked lists

Solution

1. Step 1: Understand playlist operations

   Playlist requires frequent insertions and deletions at any position, which can be slow in arrays due to shifting.

2. Step 2: Compare data structures

   Linked lists allocate memory dynamically and allow changing pointers to insert or remove nodes efficiently without shifting elements.

3. Final Answer:

   Because linked lists allow dynamic memory allocation and efficient insertions/removals anywhere -> Option A

4. Quick Check:

   Dynamic insert/delete efficiency = A [OK]

Hint: Linked lists handle frequent insert/delete better than arrays [OK]

Common Mistakes:

• Thinking arrays resize automatically without cost
• Believing linked lists store elements contiguously
• Confusing arrays with pointer-based structures