Why Linked List Exists and What Problem It Solves in DSA C - Performance Analysis

Time Complexity: Why Linked List Exists and What Problem It Solves

O(1)

Understanding Time Complexity

We want to understand why linked lists are useful by looking at how their operations take time as data grows.

What problem does a linked list solve compared to other ways of storing data?

Scenario Under Consideration

Analyze the time complexity of inserting an element at the start of a linked list.

#include <stdlib.h>

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

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

This code adds a new item at the beginning of the linked list quickly.

Identify Repeating Operations

Look for loops or repeated steps in this operation.

• Primary operation: Creating a new node and changing pointers.
• How many times: This happens once per insertion, no loops involved.

How Execution Grows With Input

Adding at the start takes the same steps no matter how big the list is.

Input Size (n)	Approx. Operations
10	5 steps (allocate, assign, link, update head)
100	5 steps (same as above)
1000	5 steps (still the same)

Pattern observation: The time to insert at the head does not grow with list size; it stays constant.

Final Time Complexity

Time Complexity: O(1)

This means inserting at the start takes the same short time no matter how many items are in the list.

Common Mistake

[X] Wrong: "Adding an item at the start takes longer as the list grows because the list is bigger."

[OK] Correct: We only change a few pointers at the start, so the list size does not affect this operation's time.

Interview Connect

Understanding why linked lists allow quick insertions helps you explain data structure choices clearly and confidently.

Self-Check

"What if we wanted to insert at the end of the linked list instead? How would the time complexity change?"

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