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 or removing one.

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

Dry Run Walkthrough

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

Goal: Show how linked list avoids moving all elements when inserting at start

Step 1: Create new node with value 4

new_node[4] -> null
head -> [1] -> [2] -> [3] -> null

Why: We prepare a new node to add without touching existing nodes

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

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

Why: Link new node to the start of the list

Step 3: Update head to new node

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

Why: Now the list starts with the new node without moving others

Result:

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

Annotated Code

DSA C

#include <stdio.h>
#include <stdlib.h>

// Node structure for linked list
typedef struct Node {
    int data;
    struct Node* next;
} Node;

// Function to create a new node
Node* createNode(int value) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = value;
    newNode->next = NULL;
    return newNode;
}

// Insert at start of linked list
void insertAtStart(Node** head, int value) {
    Node* newNode = createNode(value); // create new node
    newNode->next = *head;            // link new node to current head
    *head = newNode;                  // update head to new node
}

// Print linked list
void printList(Node* head) {
    Node* curr = head;
    while (curr != NULL) {
        printf("%d -> ", curr->data);
        curr = curr->next;
    }
    printf("null\n");
}

int main() {
    // Create initial list 1->2->3->null
    Node* head = createNode(1);
    head->next = createNode(2);
    head->next->next = createNode(3);

    printf("Original list:\n");
    printList(head);

    // Insert 4 at start
    insertAtStart(&head, 4);

    printf("After inserting 4 at start:\n");
    printList(head);

    return 0;
}

Node* newNode = createNode(value); // create new node

create new node with given value

newNode->next = *head; // link new node to current head

point new node's next to current head to link it

*head = newNode; // update head to new node

update head pointer to new node to start list here

Output

Original list:

1 -> 2 -> 3 -> null

After inserting 4 at start:

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

Complexity Analysis

Time: O(1) because inserting at 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 do it in constant time O(1)

Edge Cases

empty list (head is NULL)

new node becomes the head and next points to NULL

DSA C

newNode->next = *head;

When to Use This Pattern

When you need to add or remove items often at the start or middle without moving all elements, linked list pattern helps by using pointers to link nodes.

Common Mistakes

Mistake: Not updating the head pointer after inserting at start
Fix: Assign the head pointer to the new node after linking it

Summary

Linked list lets you add or remove items easily by changing pointers, not moving data.

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

The key is each item points to the next, so you only change links to update the list.

Practice

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

easy

A. Because linked lists are faster to access 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 continuous 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 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:

   Linked list insertion/deletion is easier than array shifting [OK]

Hint: Linked lists avoid shifting elements on insert/delete [OK]

Common Mistakes:

• Thinking linked lists use less memory always
• Believing linked lists store elements contiguously
• Assuming linked lists have faster index access

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

easy

A. struct Node { int data; Node* next; };

B. struct Node { int data; int next; };

C. struct Node { int data; struct Node* next; };

D. struct Node { int data; struct Node next; };

Solution

1. Step 1: Check pointer usage in struct

   In C, to refer to the same struct type inside itself, we use 'struct Node* next;' as a pointer to next node.

2. Step 2: Identify correct syntax

   struct Node { int data; struct Node* next; }; correctly declares 'struct Node* next;' while others either use wrong types or missing 'struct' keyword.

3. Final Answer:

   struct Node { int data; struct Node* next; }; -> Option C

4. Quick Check:

   Use 'struct Node* next;' for linked list node pointer [OK]

Hint: Use 'struct Node* next;' to link nodes in C [OK]

Common Mistakes:

• Omitting 'struct' keyword before Node pointer
• Using 'int' instead of pointer for next
• Declaring next as struct instead of pointer

3. What will be the output of the following C code snippet that creates a linked list with two nodes and prints their data?

struct Node { int data; struct Node* next; };

int main() {
  struct Node node1, node2;
  node1.data = 10;
  node1.next = &node2;
  node2.data = 20;
  node2.next = NULL;

  struct Node* ptr = &node1;
  while (ptr != NULL) {
    printf("%d ", ptr->data);
    ptr = ptr->next;
  }
  return 0;
}

medium

A. Compilation error

B. 20 10

C. 10

D. 10 20

Solution

1. Step 1: Understand linked list creation

   node1 points to node2, node2 points to NULL. So list is 10 -> 20 -> NULL.

2. Step 2: Trace the print loop

   Pointer starts at node1, prints 10, moves to node2, prints 20, then NULL ends loop.

3. Final Answer:

   10 20 -> Option D

4. Quick Check:

   Prints nodes in order: 10 then 20 [OK]

Hint: Follow next pointers to print nodes in order [OK]

Common Mistakes:

• Confusing order of nodes
• Forgetting to set node2.next to NULL
• Assuming compilation error due to struct

4. Identify the error in the following code snippet that tries to insert a new node at the beginning of a linked list:

struct Node {
  int data;
  struct Node* next;
};

void insertAtBeginning(struct Node* head, int value) {
  struct Node* newNode = malloc(sizeof(struct Node));
  newNode->data = value;
  newNode->next = head;
  head = newNode;
}

medium

A. head is passed by value, so the original list head is not updated

B. malloc is not used correctly to allocate memory

C. newNode->next should be NULL instead of head

D. Function should return void* instead of void

Solution

1. Step 1: Check parameter passing

   head is passed by value, so changing head inside function does not affect original head pointer outside.

2. Step 2: Understand pointer update requirement

   To update head, function should take pointer to pointer (struct Node** head) or return new head pointer.

3. Final Answer:

   head is passed by value, so the original list head is not updated -> Option A

4. Quick Check:

   Pointer changes inside function must affect caller [OK]

Hint: Pass pointer to pointer to update head outside function [OK]

Common Mistakes:

• Assuming malloc usage is wrong
• Thinking newNode->next should be NULL
• Confusing function return type

5. You want to store a list of unknown size where frequent insertions and deletions happen anywhere in the list. Which data structure is best and why?

hard

A. Linked list, because it allows efficient insertions and deletions without shifting

B. Array, because it provides fast random access

C. Stack, because it supports last-in-first-out operations

D. Queue, because it supports first-in-first-out operations

Solution

1. Step 1: Analyze requirements

   Unknown size and frequent insertions/deletions anywhere require flexible size and efficient updates.

2. Step 2: Compare data structures

   Arrays have fixed size or costly resizing and require shifting on insert/delete. Stack and queue have restricted access patterns.

3. Step 3: Choose linked list

   Linked list nodes can be inserted or deleted by changing pointers without shifting, and size can grow dynamically.

4. Final Answer:

   Linked list, because it allows efficient insertions and deletions without shifting -> Option A

5. Quick Check:

   Linked list suits dynamic size and frequent insert/delete [OK]

Hint: Use linked list for dynamic size and easy insert/delete [OK]

Common Mistakes:

• Choosing array despite costly shifting
• Confusing stack/queue with general list
• Ignoring dynamic size needs