Why Doubly Linked List Over Singly Linked List in DSA Rust - Quick Recap

Recall & Review

beginner

What is a key advantage of a doubly linked list compared to a singly linked list?

A doubly linked list allows traversal in both directions (forward and backward), while a singly linked list only allows forward traversal.

intermediate

How does a doubly linked list improve deletion of a node compared to a singly linked list?

In a doubly linked list, deletion is easier because each node has a pointer to its previous node, so you don't need to traverse from the head to find the previous node.

beginner

Why might a doubly linked list use more memory than a singly linked list?

Because each node in a doubly linked list stores two pointers (previous and next), it uses more memory than a singly linked list which stores only one pointer (next).

intermediate

In what scenario is a doubly linked list more efficient than a singly linked list?

When you need to frequently traverse backward or delete nodes without starting from the head, a doubly linked list is more efficient.

intermediate

What is a trade-off when choosing a doubly linked list over a singly linked list?

The trade-off is between extra memory usage and more flexible navigation; doubly linked lists use more memory but allow easier backward traversal and deletion.

Which pointer(s) does a node in a doubly linked list contain?

A Pointers to both previous and next nodes

B Pointer to next node only

C Pointer to previous node only

D No pointers

A doubly linked list node contains pointers to both its previous and next nodes, enabling two-way traversal.

Why is deletion easier in a doubly linked list than in a singly linked list?

A Because nodes only point forward

B Because nodes have no pointers

C Because nodes are stored in an array

D Because nodes have a pointer to the previous node

Having a pointer to the previous node allows direct access to the node before the one to delete, simplifying deletion.

What is a disadvantage of doubly linked lists compared to singly linked lists?

A They cannot be traversed backward

B They use more memory per node

C They are slower to traverse forward

D They do not support deletion

Doubly linked lists use more memory because each node stores two pointers instead of one.

When would you prefer a singly linked list over a doubly linked list?

A When memory usage must be minimal and backward traversal is not needed

B When you need to traverse backward frequently

C When you want faster deletion of nodes

D When you want to store extra data in nodes

Singly linked lists use less memory and are simpler when backward traversal is unnecessary.

Which operation is more efficient in a doubly linked list than in a singly linked list?

A Inserting at the head

B Traversing from head to tail

C Deleting a node given a pointer to it

D Accessing a node by index

Deletion is more efficient because the previous node pointer allows direct access to update links.

Explain why a doubly linked list might be chosen over a singly linked list in a program.

Think about navigation and memory trade-offs.

Describe the main trade-offs between singly and doubly linked lists.

Consider what each list can do and what it costs.

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