Why Doubly Linked List Over Singly Linked List in DSA C# - Quick Recap

Recall & Review

beginner

What is a doubly linked list?

A doubly linked list is a type of linked list where each node has two links: one to the next node and one to the previous node. This allows traversal in both directions.

beginner

What is the main difference between singly and doubly linked lists?

Singly linked lists have nodes with one link pointing only to the next node, while doubly linked lists have nodes with two links: one to the next node and one to the previous node.

intermediate

Why might you choose a doubly linked list over a singly linked list?

Because doubly linked lists allow easy backward traversal and efficient deletion of nodes when you have a pointer to the node, which singly linked lists do not support efficiently.

intermediate

What is a disadvantage of doubly linked lists compared to singly linked lists?

Doubly linked lists use more memory because each node stores an extra pointer to the previous node, and operations can be slightly slower due to managing two pointers.

intermediate

How does deletion differ between singly and doubly linked lists?

In singly linked lists, to delete a node, you need to know the previous node to update its next pointer. In doubly linked lists, you can delete a node directly using its previous and next pointers.

Which linked list allows traversal in both directions?

A None of the above

B Singly linked list

C Circular linked list

D Doubly linked list

Doubly linked lists have pointers to both next and previous nodes, enabling forward and backward traversal.

What extra pointer does a doubly linked list node have compared to a singly linked list node?

A Pointer to the previous node

B Pointer to the head node

C Pointer to the tail node

D Pointer to the next node

Doubly linked list nodes have an additional pointer to the previous node.

Why is deletion easier in a doubly linked list?

A Because nodes are stored in an array

B Because each node has a pointer to the previous node

C Because nodes have no pointers

D Because singly linked lists do not allow deletion

The previous pointer allows direct access to the node before the one to delete, making deletion easier.

What is a disadvantage of doubly linked lists?

A They do not support insertion

B They cannot be traversed backwards

C They use more memory per node

D They are slower to traverse forwards

Doubly linked lists use extra memory because each node stores two pointers.

Which linked list is better if you only need to traverse in one direction?

A Singly linked list

B Doubly linked list

C Both are equally good

D Neither is suitable

Singly linked lists are simpler and use less memory when only forward traversal is needed.

Explain why a doubly linked list might be preferred over a singly linked list in certain situations.

Think about how nodes connect and how you can move through the list.

Describe the main trade-offs between using a singly linked list and a doubly linked list.

Consider what each node stores and how that affects list operations.

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