Why Doubly Linked List Over Singly Linked List in DSA Python - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

Why use a doubly linked list instead of a singly linked list?

Which of the following is the main advantage of a doubly linked list over a singly linked list?

A It allows traversal in both forward and backward directions.

B It uses less memory per node than a singly linked list.

C It requires fewer pointers to manage the list.

D It can only be traversed from the head to the tail.

💡 Hint

Think about how you can move through the list in both directions.

A doubly linked list has two pointers per node, allowing traversal forward and backward. A singly linked list only allows forward traversal.

❓ Predict Output

intermediate

Output of traversing a doubly linked list backwards

What will be the output of the following code that traverses a doubly linked list backwards?

DSA Python

class Node:
    def __init__(self, data):
        self.data = data
        self.prev = None
        self.next = None

class DoublyLinkedList:
    def __init__(self):
        self.head = None
        self.tail = None

    def append(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
            self.tail = new_node
        else:
            self.tail.next = new_node
            new_node.prev = self.tail
            self.tail = new_node

    def traverse_backward(self):
        current = self.tail
        result = []
        while current:
            result.append(current.data)
            current = current.prev
        print(' -> '.join(map(str, result)) + ' -> null')

# Create list and append elements
dll = DoublyLinkedList()
dll.append(1)
dll.append(2)
dll.append(3)
dll.traverse_backward()

A 1 -> 2 -> 3 -> null

B 3 -> 2 -> 1 -> null

C null -> 3 -> 2 -> 1

D 1 -> null

💡 Hint

Look at how the traversal starts from the tail and moves using the prev pointer.

The traversal starts at the tail node (3) and moves backward using the prev pointer, printing 3, then 2, then 1.

🔧 Debug

advanced

Identify the bug in doubly linked list node removal

What is the error in the following code that removes a node from a doubly linked list?

DSA Python

def remove_node(node):
    if node.prev:
        node.prev.next = node.next
    if node.next:
        node.next.prev = node.prev
    node = None

A The node is not properly disconnected because setting 'node = None' only changes the local reference.

B The code will raise an AttributeError if node.prev is None.

C The code does not update the head or tail pointers of the list.

D The code will cause a memory leak by not freeing the node.

💡 Hint

Think about what 'node = None' does inside the function.

Setting 'node = None' only changes the local variable inside the function, it does not remove references to the node outside the function.

❓ Predict Output

advanced

Result of inserting a node in the middle of a doubly linked list

What will be the printed output after inserting a node with value 4 between nodes 3 and 5?

DSA Python

class Node:
    def __init__(self, data):
        self.data = data
        self.prev = None
        self.next = None

class DoublyLinkedList:
    def __init__(self):
        self.head = None

    def append(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
            return
        last = self.head
        while last.next:
            last = last.next
        last.next = new_node
        new_node.prev = last

    def insert_after(self, prev_node, data):
        if not prev_node:
            return
        new_node = Node(data)
        new_node.next = prev_node.next
        new_node.prev = prev_node
        if prev_node.next:
            prev_node.next.prev = new_node
        prev_node.next = new_node

    def print_list(self):
        current = self.head
        result = []
        while current:
            result.append(current.data)
            current = current.next
        print(' -> '.join(map(str, result)) + ' -> null')

# Setup list
dll = DoublyLinkedList()
dll.append(1)
dll.append(3)
dll.append(5)

# Insert 4 after 3
current = dll.head
while current and current.data != 3:
    current = current.next

dll.insert_after(current, 4)
dll.print_list()

A 1 -> 4 -> 3 -> 5 -> null

B 1 -> 3 -> 5 -> null

C 1 -> 3 -> 5 -> 4 -> null

D 1 -> 3 -> 4 -> 5 -> null

💡 Hint

Check how the new node is linked between 3 and 5.

The new node with value 4 is inserted after node 3 and before node 5, so the list becomes 1 -> 3 -> 4 -> 5 -> null.

🧠 Conceptual

expert

Memory trade-offs of doubly linked lists

Why might a doubly linked list be less memory efficient than a singly linked list?

A Because doubly linked lists store nodes in contiguous memory blocks.

B Because doubly linked lists require extra memory for storing data values twice.

C Because each node stores two pointers, increasing memory usage per node.

D Because doubly linked lists use recursion which consumes more stack memory.

💡 Hint

Think about how many pointers each node holds in both list types.

Doubly linked list nodes have two pointers (prev and next), so they use more memory per node than singly linked lists, which have only one pointer.

Practice

1. Why might a doubly linked list be preferred over a singly linked list when you need to traverse the list backwards?

easy

A. Because doubly linked lists have pointers to both next and previous nodes, allowing backward traversal.

B. Because singly linked lists use less memory, making backward traversal faster.

C. Because singly linked lists have built-in backward pointers.

D. Because doubly linked lists store data twice for faster access.

Solution

1. Step 1: Understand pointer structure in doubly linked lists

   Doubly linked lists have two pointers per node: one to the next node and one to the previous node.

2. Step 2: Compare with singly linked lists

   Singly linked lists only have a pointer to the next node, so they cannot move backwards easily.

3. Final Answer:

   Because doubly linked lists have pointers to both next and previous nodes, allowing backward traversal. -> Option A

4. Quick Check:

   Backward traversal needs previous pointers = A [OK]

Hint: Backward traversal needs previous pointers, only in doubly linked lists [OK]

Common Mistakes:

• Thinking singly linked lists can traverse backwards easily
• Confusing memory usage with traversal ability
• Assuming doubly linked lists duplicate data

2. Which of the following is the correct way to define a node in a doubly linked list in Python?

easy

A. class Node:
def __init__(self, data):
self.data = data
self.next = None
self.prev = None

B. class Node:
def __init__(self, data):
self.data = data
self.next = None

C. class Node:
def __init__(self, data):
self.data = data
self.prev = None

D. class Node:
def __init__(self, data):
self.next = None
self.prev = None

Solution

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

   A doubly linked list node must have pointers to both next and previous nodes.

2. Step 2: Check each option for correct attributes

   class Node: def __init__(self, data): self.data = data self.next = None self.prev = None correctly defines data, next, and prev attributes in __init__.

3. Final Answer:

   class Node:\n def __init__(self, data):\n self.data = data\n self.next = None\n self.prev = None -> Option A

4. Quick Check:

   Doubly linked list node needs next and prev = A [OK]

Hint: Doubly linked list nodes have both next and prev pointers [OK]

Common Mistakes:

• Omitting the prev pointer
• Defining only prev without next
• Not initializing data attribute

3. What will be the output of the following code snippet that uses a doubly linked list?

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None
        self.prev = None

class DoublyLinkedList:
    def __init__(self):
        self.head = None

    def append(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
            return
        last = self.head
        while last.next:
            last = last.next
        last.next = new_node
        new_node.prev = last

    def print_reverse(self):
        current = self.head
        while current.next:
            current = current.next
        result = []
        while current:
            result.append(current.data)
            current = current.prev
        print(result)

dll = DoublyLinkedList()
dll.append(1)
dll.append(2)
dll.append(3)
dll.print_reverse()

medium

A. [1, 2, 3]

B. []

C. [1, 3, 2]

D. [3, 2, 1]

Solution

1. Step 1: Append nodes 1, 2, 3 to doubly linked list

   Nodes are added at the end, so list is 1 <-> 2 <-> 3.

2. Step 2: Traverse to last node and print in reverse

   print_reverse moves to last node (3), then collects data moving backward: 3, 2, 1.

3. Final Answer:

   [3, 2, 1] -> Option D

4. Quick Check:

   Reverse traversal collects nodes backward = B [OK]

Hint: Reverse print collects data from tail to head using prev pointers [OK]

Common Mistakes:

• Confusing forward and backward traversal
• Printing in insertion order instead of reverse
• Not updating prev pointers correctly

4. The following code tries to delete the last node from a doubly linked list but causes an error. What is the mistake?

def delete_last(self):
    if not self.head:
        return
    current = self.head
    while current.next:
        current = current.next
    current.prev.next = None
    current.prev = None

medium

A. It sets current.prev to None before removing the node.

B. It tries to delete the head node instead of the last node.

C. It does not handle the case when the list has only one node.

D. It does not update the head pointer after deletion.

Solution

1. Step 1: Analyze deletion logic for last node

   The code moves to the last node, then sets previous node's next to None to remove last node.

2. Step 2: Check edge case for single-node list

   If list has only one node, current.prev is None, so current.prev.next causes error.

3. Final Answer:

   It does not handle the case when the list has only one node. -> Option C

4. Quick Check:

   Single-node list needs special handling = C [OK]

Hint: Check for single-node list before accessing prev pointers [OK]

Common Mistakes:

• Ignoring empty or single-node list edge cases
• Assuming prev always exists
• Not updating head when list becomes empty

5. You want to implement a feature that allows moving both forward and backward through a playlist of songs efficiently. Why is a doubly linked list better than a singly linked list for this, and what is a key trade-off?

hard

A. Singly linked lists are better because they have prev pointers; trade-off is more CPU usage.

B. Doubly linked lists allow easy forward and backward moves; trade-off is extra memory for prev pointers.

C. Doubly linked lists use less memory and are faster; trade-off is complex code.

D. Singly linked lists allow backward moves with less memory; trade-off is slower forward moves.

Solution

1. Step 1: Understand traversal needs for playlist

   Moving forward and backward efficiently requires pointers in both directions.

2. Step 2: Compare singly vs doubly linked lists

   Doubly linked lists have next and prev pointers, enabling easy two-way traversal; singly linked lists only have next pointers.

3. Step 3: Identify trade-off

   Extra prev pointers in doubly linked lists use more memory compared to singly linked lists.

4. Final Answer:

   Doubly linked lists allow easy forward and backward moves; trade-off is extra memory for prev pointers. -> Option B

5. Quick Check:

   Two-way traversal needs prev pointers, costs extra memory = D [OK]

Hint: Two-way moves need prev pointers; extra memory is the cost [OK]

Common Mistakes:

• Thinking singly linked lists support backward moves easily
• Ignoring memory cost of extra pointers
• Confusing speed with memory trade-offs