Why Doubly Linked List Structure and Node Design in DSA Python?

The Big Idea

What if you could travel back and forth through your data as easily as flipping pages in a book?

The Scenario

Imagine you have a long chain of paper clips linked together. You want to add or remove clips from anywhere in the chain, but you can only move forward through the clips, one by one.

This is like managing a list of items manually, where you can only go forward and have to remember everything as you go.

The Problem

Going through the chain one by one to find a clip is slow and tiring. If you want to go backward, you have to start over or remember the path, which is easy to forget or mess up.

This makes adding or removing clips in the middle very hard and error-prone.

The Solution

A doubly linked list is like a chain where each clip knows both the clip before it and the clip after it.

This lets you move forward or backward easily, making adding or removing clips anywhere simple and fast.

Before vs After

✗ Before

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

# To remove a node, you must find the previous node first

✓ After

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

# Each node knows its previous and next, so removal is easier

What It Enables

It enables quick and easy navigation and updates in both directions of a list, making data management flexible and efficient.

Real Life Example

Think of a music playlist where you can go to the next song or back to the previous song smoothly without restarting the list.

Key Takeaways

Doubly linked lists let you move forward and backward easily.

Each node stores links to both neighbors, simplifying updates.

This structure makes adding and removing items anywhere faster and less error-prone.

Practice

1. What is the main difference between a doubly linked list node and a singly linked list node?

easy

A. A doubly linked list node does not store any data.

B. A doubly linked list node has pointers to both the previous and next nodes.

C. A doubly linked list node can only point to the next node.

D. A doubly linked list node stores data in a different format.

Solution

1. Step 1: Understand node pointers in singly linked list

   A singly linked list node has only one pointer to the next node.

2. Step 2: Understand node pointers in doubly linked list

   A doubly linked list node has two pointers: one to the previous node and one to the next node.

3. Final Answer:

   A doubly linked list node has pointers to both the previous and next nodes. -> Option B

4. Quick Check:

   Doubly linked list nodes have two pointers = D [OK]

Hint: Remember: doubly means two pointers, singly means one [OK]

Common Mistakes:

• Thinking doubly linked list nodes store data differently
• Confusing pointer count between singly and doubly linked lists
• Assuming doubly linked list nodes have only one pointer

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

easy

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

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

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

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

Solution

1. Step 1: Check for data storage and pointers

   A doubly linked list node must store data and have both prev and next pointers.

2. Step 2: Verify class definitions

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

3. Final Answer:

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

4. Quick Check:

   Node class with data, prev, next = B [OK]

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

Common Mistakes:

• Omitting the prev pointer
• Not initializing data attribute
• Defining only next pointer like singly linked list

3. What will be the output of the following code snippet?

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

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

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

current = third
result = []
while current:
    result.append(current.data)
    current = current.prev
print(result)

medium

A. [3, 2, 1]

B. [1, 2, 3]

C. [1, 3, 2]

D. [3, 1, 2]

Solution

1. Step 1: Understand the linked list connections

   Nodes are linked as 1 <-> 2 <-> 3 with prev and next pointers set correctly.

2. Step 2: Trace the while loop starting from third node

   Starting at node with data 3, append 3, move to prev (2), append 2, move to prev (1), append 1, then prev is None, loop ends.

3. Final Answer:

   [3, 2, 1] -> Option A

4. Quick Check:

   Traverse backward from third node = [3, 2, 1] [OK]

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

Common Mistakes:

• Confusing next and prev pointers during traversal
• Starting traversal from head instead of third
• Appending data in wrong order

4. Identify the error in the following doubly linked list node insertion code and select the correct fix.

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

head = Node(1)
new_node = Node(2)

# Insert new_node after head
new_node.next = head.next
head.next.prev = new_node
head.next = new_node
new_node.prev = head

medium

A. No error; code inserts node correctly.

B. new_node.prev should be assigned before head.next.

C. head.next.prev causes AttributeError; fix by checking if head.next is not None before accessing prev.

D. new_node.next should be assigned after head.next.

Solution

1. Step 1: Analyze head.next before insertion

   Initially, head.next is None, so head.next.prev causes AttributeError.

2. Step 2: Fix by checking if head.next exists before accessing prev

   Adding a condition to check if head.next is not None before setting head.next.prev avoids error.

3. Final Answer:

   head.next.prev causes AttributeError; fix by checking if head.next is not None before accessing prev. -> Option C

4. Quick Check:

   Check for None before accessing prev pointer [OK]

Hint: Always check if next node exists before accessing its prev [OK]

Common Mistakes:

• Ignoring None check causing runtime error
• Assigning pointers in wrong order
• Assuming head.next is always valid

5. You want to insert a new node with value 4 between nodes with values 2 and 3 in a doubly linked list. Given the nodes are connected as 1 <-> 2 <-> 3, which sequence of pointer updates correctly inserts the new node?

hard

A. new_node.prev = node2; new_node.next = node3; node2.next = new_node; node3.prev = new_node

B. new_node.next = node2; new_node.prev = node3; node3.next = new_node; node2.prev = new_node

C. node2.next = new_node; new_node.next = node3; node3.next = new_node; new_node.prev = node2

D. node3.prev = new_node; new_node.prev = node2; node2.next = new_node; new_node.next = node2

Solution

1. Step 1: Set new_node pointers to neighbors

   new_node.prev should point to node2 and new_node.next to node3 to link correctly.

2. Step 2: Update neighbors to point to new_node

   node2.next must point to new_node and node3.prev must point to new_node to complete insertion.

3. Final Answer:

   new_node.prev = node2; new_node.next = node3; node2.next = new_node; node3.prev = new_node -> Option A

4. Quick Check:

   Set new_node pointers then update neighbors [OK]

Hint: Link new node to neighbors, then neighbors back to new node [OK]

Common Mistakes:

• Swapping prev and next pointers
• Updating neighbors before setting new_node pointers
• Forgetting to update one neighbor pointer