Why Doubly Linked List Over Singly Linked List in DSA Python - Why This Pattern

Mental Model

A doubly linked list lets you move forward and backward easily, unlike a singly linked list which only moves forward.

Analogy: Think of a train with cars connected front and back. You can walk from the first car to the last or go back from the last to the first. A singly linked list is like a train where you can only walk forward.

Head -> 1 ↔ 2 ↔ 3 ↔ 4 -> null
Each node points both ways with arrows ← and ->

Dry Run Walkthrough

Input: list: 1->2->3, delete last node

Goal: Show how deleting the last node is easier with a doubly linked list than with a singly linked list

Step 1: Start at head node 1

Head -> 1 ↔ 2 ↔ 3 -> null

Why: We begin at the start to find the last node

Step 2: Move forward to node 2

Head -> 1 ↔ [curr->2] ↔ 3 -> null

Why: We need to reach the last node to delete it

Step 3: Move forward to node 3 (last node)

Head -> 1 ↔ 2 ↔ [curr->3] -> null

Why: We found the last node to delete

Step 4: Use backward pointer from node 3 to node 2 and remove node 3

Head -> 1 ↔ 2 -> null

Why: Backward pointer lets us directly access node before last to update its next pointer

Result:

Head -> 1 ↔ 2 -> null
Last node deleted easily using backward pointer

Annotated Code

DSA Python

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

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

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

    def delete_last(self):
        if not self.head:
            return
        curr = self.head
        while curr.next:
            curr = curr.next  # advance curr to last node
        if curr.prev:
            curr.prev.next = None  # remove last node by updating prev node's next
        else:
            self.head = None  # list had one node, now empty

    def print_list(self):
        curr = self.head
        res = []
        while curr:
            res.append(str(curr.val))
            curr = curr.next
        print(" -> ".join(res) + " -> null")

# Driver code
dll = DoublyLinkedList()
dll.append(1)
dll.append(2)
dll.append(3)
dll.print_list()  # before deletion

dll.delete_last()
dll.print_list()  # after deletion

while curr.next: curr = curr.next # advance curr to last node

move curr forward to reach last node

if curr.prev: curr.prev.next = None # remove last node by updating prev node's next

use backward pointer to unlink last node quickly

else: self.head = None # list had one node, now empty

handle case when list has only one node

Output

1 -> 2 -> 3 -> null

1 -> 2 -> null

Complexity Analysis

Time: O(n) because we traverse nodes to reach the last one

Space: O(n) for storing n nodes in the list

vs Alternative: Singly linked list requires traversing to the second last node to delete last, no backward pointer to jump back, so doubly linked list saves time in backward operations

Edge Cases

empty list

delete_last does nothing safely

DSA Python

if not self.head:
    return

list with one node

head becomes None after deletion

DSA Python

else:
    self.head = None  # list had one node, now empty

When to Use This Pattern

When you need to move both forward and backward in a list or delete nodes from the end efficiently, reach for doubly linked list because it has backward pointers.

Common Mistakes

Mistake: Trying to delete last node in singly linked list without tracking previous node
Fix: Use a doubly linked list or keep track of previous node during traversal

Summary

Doubly linked list allows easy forward and backward traversal.

Use it when you need to delete or insert nodes from both ends efficiently.

The key is having pointers in both directions to avoid costly traversals.

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