Why Doubly Linked List Over Singly Linked List in DSA C# - Test Your Knowledge

Practice - 5 Tasks

1fill in blank

easy

Complete the code to add a new node at the end of a doubly linked list.

DSA C#

public void AddLast(int value) {
    Node newNode = new Node(value);
    if (head == null) {
        head = newNode;
        tail = newNode;
    } else {
        tail.[1] = newNode;
        newNode.Prev = tail;
        tail = newNode;
    }
}

Drag options to blanks, or click blank then click option'

ANext

BPrev

CHead

DTail

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'Prev' instead of 'Next' causes the list to link backwards incorrectly.

Assigning to 'Head' or 'Tail' inside the else block incorrectly.

In a doubly linked list, the 'Next' pointer of the current tail node should point to the new node to add it at the end.

2fill in blank

medium

Complete the code to remove the last node from a doubly linked list.

DSA C#

public void RemoveLast() {
    if (tail == null) return;
    if (head == tail) {
        head = null;
        tail = null;
    } else {
        tail = tail.[1];
        tail.Next = null;
    }
}

Drag options to blanks, or click blank then click option'

ANext

BPrev

CHead

DTail

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'Next' moves tail forward, which is incorrect.

Setting tail to head or null incorrectly.

To remove the last node, move the tail pointer to the previous node using 'Prev'.

3fill in blank

hard

Fix the error in the code to insert a node after a given node in a doubly linked list.

DSA C#

public void InsertAfter(Node node, int value) {
    if (node == null) return;
    Node newNode = new Node(value);
    newNode.Next = node.Next;
    newNode.Prev = node;
    if (node.Next != null) {
        node.Next.[1] = newNode;
    }
    node.Next = newNode;
}

Drag options to blanks, or click blank then click option'

APrev

BNext

CHead

DTail

Attempts:

3 left

💡 Hint

Common Mistakes

Updating 'Next' instead of 'Prev' causes broken backward links.

Not updating the next node's pointer at all.

When inserting after a node, the next node's 'Prev' pointer must point back to the new node.

4fill in blank

hard

Fill both blanks to traverse a doubly linked list from tail to head and print values.

DSA C#

public void PrintReverse() {
    Node current = tail;
    while (current != null) {
        Console.WriteLine(current.Value);
        current = current.[1];
    }
}

// To start from tail, assign tail to [2] before loop.

Drag options to blanks, or click blank then click option'

APrev

BNext

Chead

Dtail

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'Next' to move backward causes infinite loop or error.

Starting from 'head' instead of 'tail' for reverse traversal.

To move backward, use 'Prev'. To start from the end, assign 'tail' to the current node.

5fill in blank

hard

Fill all three blanks to create a dictionary of node values and their previous node values (or null if none).

DSA C#

var prevValues = new Dictionary<int, int?>();
Node current = head;
while (current != null) {
    prevValues[[1]] = current.[2] == null ? (int?)null : current.Prev.Value;
    current = current.[3];
}

Drag options to blanks, or click blank then click option'

Acurrent.Value

BPrev

CNext

Dhead

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'Next' instead of 'Prev' to get previous node value.

Using 'Prev' to move forward instead of 'Next'.

Using 'current' instead of 'current.Value' as dictionary key.

Use 'current.Value' as key, 'Prev' to check previous node, and 'Next' to move forward.

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