Why Doubly Linked List Over Singly Linked List in DSA Rust - The Real Reason

The Big Idea

What if you could move backward just as easily as forward in your data? Discover how doubly linked lists make this possible!

The Scenario

Imagine you have a long chain of paper clips linked one after another. You want to find a specific clip and then go back to the previous one easily. But if you can only move forward, it becomes frustrating to go back.

The Problem

With a singly linked list, you can only move forward from one item to the next. To go back, you must start from the beginning and move forward again, which is slow and tiring. This makes some tasks like undoing actions or moving backward very hard.

The Solution

A doubly linked list adds a link to the previous item, so you can move forward and backward easily. This makes going back simple and fast, just like having a chain you can move along in both directions.

Before vs After

✗ Before

struct Node {
    value: i32,
    next: Option<Box<Node>>,
}
// Can only move forward through next

✓ After

struct Node {
    value: i32,
    next: Option<Box<Node>>,
    prev: Option<*mut Node>,
}
// Can move forward and backward

What It Enables

It enables easy and fast navigation in both directions, making many algorithms and operations simpler and more efficient.

Real Life Example

Think of a music playlist where you want to go to the next song or quickly go back to the previous one without restarting the list.

Key Takeaways

Singly linked lists only allow forward movement.

Doubly linked lists allow moving forward and backward easily.

This makes certain tasks like undo, reverse traversal, and deletion simpler and faster.

Practice

1. Why might a doubly linked list be preferred over a singly linked list in some cases?

easy

A. Because it cannot be used to implement stacks

B. Because it allows traversal in both forward and backward directions

C. Because it only stores one pointer per node

D. Because it uses less memory than singly linked list

Solution

1. Step 1: Understand traversal capabilities

   A singly linked list allows traversal only in one direction, from head to tail.

2. Step 2: Compare with doubly linked list

   A doubly linked list stores two pointers per node, allowing traversal both forward and backward.

3. Final Answer:

   Because it allows traversal in both forward and backward directions -> Option B

4. Quick Check:

   Traversal direction = Both forward and backward [OK]

Hint: Doubly linked lists have two pointers per node [OK]

Common Mistakes:

• Thinking doubly linked lists use less memory
• Confusing pointer count per node
• Assuming singly linked lists allow backward traversal

2. Which of the following is the correct way to declare a node struct for a doubly linked list in Rust?

easy

A. struct Node { data: i32, prev: Option, next: Option }

B. struct Node { data: i32, prev: Box<Node> }

C. struct Node { data: i32, next: Option }

D. struct Node { data: i32, next: Node }

Solution

1. Step 1: Identify doubly linked list node fields

   A doubly linked list node must have pointers to both previous and next nodes, usually wrapped in Option and Box for ownership.

2. Step 2: Check each option

   struct Node { data: i32, prev: Option, next: Option } correctly declares both prev and next as Option. Others miss prev or use incorrect types.

3. Final Answer:

   struct Node { data: i32, prev: Option, next: Option } -> Option A

4. Quick Check:

   Prev and next pointers = struct Node { data: i32, prev: Option, next: Option } [OK]

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

Common Mistakes:

• Omitting prev pointer
• Using Box<Node> without Option
• Using next as Node instead of pointer

3. Given this Rust code snippet for a doubly linked list insertion at the end, what will be the printed list after inserting 3 nodes with values 10, 20, 30?

let mut list = DoublyLinkedList::new();
list.push_back(10);
list.push_back(20);
list.push_back(30);
list.print_forward();

medium

A. 10 -> 30 -> 20 -> null

B. 30 -> 20 -> 10 -> null

C. null -> 10 -> 20 -> 30

D. 10 -> 20 -> 30 -> null

Solution

1. Step 1: Understand push_back behavior

   push_back adds nodes at the end, so nodes are appended in order 10, then 20, then 30.

2. Step 2: Trace print_forward output

   Printing forward shows nodes from head to tail: 10 -> 20 -> 30 -> null.

3. Final Answer:

   10 -> 20 -> 30 -> null -> Option D

4. Quick Check:

   Insertion order = Printed order [OK]

Hint: push_back appends at tail, print_forward shows head to tail [OK]

Common Mistakes:

• Confusing push_back with push_front
• Printing backward instead of forward
• Mixing node order in output

4. In this Rust doubly linked list code, what is the bug causing incorrect backward traversal?

fn print_backward(&self) {
    let mut current = self.tail.clone();
    while let Some(node) = current {
        print!("{} -> ", node.data);
        current = node.next.clone();
    }
    println!("null");
}

medium

A. Not cloning the tail pointer

B. Printing node.data instead of node.prev

C. Using node.next instead of node.prev for backward traversal

D. Missing a break statement in the loop

Solution

1. Step 1: Analyze traversal direction

   Backward traversal should follow prev pointers, but code uses node.next which goes forward.

2. Step 2: Identify correct pointer usage

   Replacing node.next with node.prev fixes backward traversal.

3. Final Answer:

   Using node.next instead of node.prev for backward traversal -> Option C

4. Quick Check:

   Backward traversal = Use prev pointer [OK]

Hint: Backward traversal uses prev pointer, not next [OK]

Common Mistakes:

• Confusing next and prev pointers
• Not cloning pointers properly
• Printing wrong data fields

5. You want to implement a feature that allows quick removal of a node from the middle of a list without traversing from the head. Why is a doubly linked list better than a singly linked list for this task?

hard

A. Because doubly linked list nodes have pointers to previous nodes, enabling direct access to neighbors

B. Because singly linked lists store extra data for quick removal

C. Because doubly linked lists use less memory, making removal faster

D. Because singly linked lists allow backward traversal

Solution

1. Step 1: Understand node removal requirements

   Removing a node requires updating pointers of its neighbors, including the previous node.

2. Step 2: Compare singly and doubly linked lists

   Singly linked lists lack backward pointers, so to remove a node, you must traverse from head to find the previous node. Doubly linked lists have prev pointers, allowing direct access to neighbors.

3. Final Answer:

   Because doubly linked list nodes have pointers to previous nodes, enabling direct access to neighbors -> Option A

4. Quick Check:

   Prev pointer enables quick removal [OK]

Hint: Prev pointer lets you remove nodes without full traversal [OK]

Common Mistakes:

• Assuming singly linked lists have backward pointers
• Thinking memory usage affects removal speed
• Confusing traversal direction capabilities