Why Doubly Linked List Over Singly Linked List in DSA C# - Performance Analysis

Time Complexity: Why Doubly Linked List Over Singly Linked List

O(n)

Understanding Time Complexity

We want to understand how using a doubly linked list changes the time it takes to do common operations compared to a singly linked list.

Which operations become faster or slower and why?

Scenario Under Consideration

Analyze the time complexity of removing a node when given a reference to it.

// Removing a node from a singly linked list
void RemoveNode(Node node) {
    if (head == node) {
        head = node.Next;
        return;
    }
    Node current = head;
    while (current != null && current.Next != node) {
        current = current.Next;
    }
    if (current != null) {
        current.Next = node.Next;
    }
}
    

This code removes a node by searching for its previous node first in a singly linked list.

Identify Repeating Operations

Look at what repeats in the code.

• Primary operation: Looping through nodes to find the previous node.
• How many times: Up to n times, where n is the number of nodes before the target.

How Execution Grows With Input

As the list grows, the search to find the previous node takes longer.

Input Size (n)	Approx. Operations
10	Up to 10 steps to find previous node
100	Up to 100 steps
1000	Up to 1000 steps

Pattern observation: The time grows linearly with the number of nodes before the target.

Final Time Complexity

Time Complexity: O(n)

This means removing a node requires checking nodes one by one until the previous node is found.

Common Mistake

[X] Wrong: "Removing a node in a singly linked list is always O(1) if you have the node reference."

[OK] Correct: You still need to find the previous node, which takes time proportional to the list size.

Interview Connect

Understanding these differences helps you explain why doubly linked lists are useful and when to choose them in real problems.

Self-Check

"What if the list was doubly linked and you had a reference to the node? How would removing it change the time complexity?"

Practice

1. Why might you choose a doubly linked list over a singly linked list in a program?

easy

A. Because it allows traversal in both directions easily

B. Because it uses less memory than singly linked list

C. Because it is simpler to implement

D. Because it only stores one pointer per node

Solution

1. Step 1: Understand traversal capabilities

   A doubly linked list stores two pointers per node: one to the next node and one to the previous node, allowing movement forward and backward.

2. Step 2: Compare with singly linked list

   A singly linked list stores only one pointer per node, allowing traversal only in one direction (forward).

3. Final Answer:

   Because it allows traversal in both directions easily -> Option A

4. Quick Check:

   Traversal both ways = A [OK]

Hint: Doubly means two directions for easy backward moves [OK]

Common Mistakes:

• Thinking doubly linked list uses less memory
• Assuming singly linked list supports backward traversal
• Confusing simplicity with functionality

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

easy

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

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

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

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

Solution

1. Step 1: Identify required pointers for doubly linked list node

   A doubly linked list node must have a pointer to the next node and a pointer to the previous node.

2. Step 2: Check each option for correct pointers

   public class Node { public int data; public Node next; public Node prev; } declares both next and prev pointers, matching the doubly linked list requirements.

3. Final Answer:

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

4. Quick Check:

   Two pointers (next, prev) = C [OK]

Hint: Doubly linked list node has next and prev pointers [OK]

Common Mistakes:

• Missing the prev pointer for doubly linked list
• Using incorrect pointer names like previous instead of prev
• Confusing singly linked list node with doubly linked list node

3. Consider the following C# code snippet for a doubly linked list:

Node head = new Node(1);
Node second = new Node(2);
Node third = new Node(3);

head.next = second;
second.prev = head;
second.next = third;
third.prev = second;

// Now move backward from third node
Node current = third;
while (current != null) {
    Console.Write(current.data + " -> ");
    current = current.prev;
}
Console.WriteLine("null");

What will be the printed output?

medium

A. 3 -> 2 -> 1 -> null

B. 1 -> 2 -> 3 -> null

C. null

D. 3 -> null

Solution

1. Step 1: Understand the list connections

   The nodes are connected as 1 <-> 2 <-> 3, with prev and next pointers set correctly.

2. Step 2: Trace backward traversal from third node

   Starting at node with data 3, moving prev goes to 2, then 1, then null, printing each data value.

3. Final Answer:

   3 -> 2 -> 1 -> null -> Option A

4. Quick Check:

   Backward traversal prints 3,2,1 [OK]

Hint: Backward traversal prints nodes in reverse order [OK]

Common Mistakes:

• Confusing forward and backward traversal output
• Forgetting to print 'null' at the end
• Assuming singly linked list traversal

4. The following code attempts to insert a new node after a given node in a doubly linked list. What is the bug?

void InsertAfter(Node prevNode, int newData) {
    if (prevNode == null) return;
    Node newNode = new Node(newData);
    newNode.next = prevNode.next;
    prevNode.next = newNode;
    newNode.prev = prevNode;
}

medium

A. It incorrectly assigns newNode.prev

B. It does not create the new node correctly

C. It does not check if prevNode is null

D. It does not update the prev pointer of the next node

Solution

1. Step 1: Analyze pointer updates after insertion

   The new node's next pointer is set to prevNode's next, and prevNode's next is updated to newNode, but the next node's prev pointer is not updated.

2. Step 2: Identify missing update for next node's prev pointer

   Without updating newNode.next.prev to point back to newNode, the list's backward links break.

3. Final Answer:

   It does not update the prev pointer of the next node -> Option D

4. Quick Check:

   Missing next node's prev update = A [OK]

Hint: Always update both next and prev pointers when inserting [OK]

Common Mistakes:

• Forgetting to update next node's prev pointer
• Assuming newNode.prev is enough
• Ignoring null checks for next node

5. You want to implement a feature that frequently deletes nodes from the middle of a linked list and also needs to traverse backward efficiently. Which linked list type is best and why?

hard

A. Singly linked list, because it uses less memory

B. Array list, because it supports random access

C. Doubly linked list, because it allows backward traversal and easy node deletion

D. Circular singly linked list, because it loops infinitely

Solution

1. Step 1: Consider deletion and traversal requirements

   Deleting nodes from the middle requires access to previous nodes to update pointers, and backward traversal needs two-way links.

2. Step 2: Match requirements with linked list types

   Doubly linked lists store both next and prev pointers, enabling efficient backward traversal and easy deletion without full traversal.

3. Final Answer:

   Doubly linked list, because it allows backward traversal and easy node deletion -> Option C

4. Quick Check:

   Backward traversal + easy deletion = D [OK]

Hint: Use doubly linked list for easy backward moves and deletions [OK]

Common Mistakes:

• Choosing singly linked list despite backward traversal need
• Confusing circular list benefits
• Ignoring memory vs functionality trade-offs