Insert at Specific Position in Doubly Linked List in DSA Rust - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to create a new node with the given value.

DSA Rust

let new_node = Box::new(Node { value: [1], prev: None, next: None });

Drag options to blanks, or click blank then click option'

Aval

Bvalue

Cdata

Ditem

Attempts:

3 left

💡 Hint

Common Mistakes

Using a variable name not defined in the function like 'value' or 'data'.

The variable holding the value to insert is named 'val' in this context.

2fill in blank

medium

Complete the code to check if the position is zero to insert at the head.

DSA Rust

if position == [1] { insert_at_head(&mut self, val); return; }

Drag options to blanks, or click blank then click option'

A1

BNone

C-1

D0

Attempts:

3 left

💡 Hint

Common Mistakes

Checking for position == 1 instead of 0.

Using None or negative numbers for position.

Position zero means inserting at the head of the list.

3fill in blank

hard

Fix the error in advancing the current node to the correct position.

DSA Rust

for _ in 0..position-1 { current = current.unwrap().next.as_mut().[1]; }

Drag options to blanks, or click blank then click option'

Aas_mut

Btake

Cclone

Dunwrap

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'clone' which copies the node instead of referencing.

Using 'unwrap' which consumes the Option and causes errors.

We need to get a mutable reference to the next node using 'as_mut()'.

4fill in blank

hard

Fill both blanks to correctly link the new node between nodes.

DSA Rust

new_node.prev = Some(Box::into_raw(current.as_mut().unwrap()));
new_node.next = current.as_mut().unwrap().next.[1];
current.as_mut().unwrap().next = Some(new_node);
if let Some(next_node) = current.as_mut().unwrap().next.as_mut().unwrap().next.[2]() {
    next_node.prev = Some(Box::into_raw(current.as_mut().unwrap().next.as_mut().unwrap()));
}

Drag options to blanks, or click blank then click option'

Atake

Bas_mut

Cunwrap

Dclone

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'clone' instead of 'take' causes duplication.

Using 'unwrap' instead of 'as_mut' consumes the Option.

Use 'take()' to move the next node out and 'as_mut()' to get mutable reference.

5fill in blank

hard

Fill all three blanks to complete the insert_at_position function correctly.

DSA Rust

fn insert_at_position(&mut self, val: i32, position: usize) {
    if position == 0 {
        self.insert_at_head(val);
        return;
    }
    let mut current = self.head.as_mut();
    for _ in 0..position-1 {
        current = current.unwrap().next.as_mut().[1]();
    }
    let mut new_node = Box::new(Node { value: val, prev: None, next: None });
    new_node.prev = Some(Box::into_raw(current.unwrap()));
    new_node.next = current.unwrap().next.[2]();
    current.unwrap().next = Some(new_node);
    if let Some(next_node) = current.unwrap().next.as_mut().unwrap().next.[3]() {
        next_node.prev = Some(Box::into_raw(current.unwrap().next.as_mut().unwrap()));
    }
}

Drag options to blanks, or click blank then click option'

Aas_mut

Btake

Cunwrap

Dclone

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'clone()' which duplicates nodes incorrectly.

Using 'unwrap()' which consumes Options and causes errors.

Use 'as_mut()' to get mutable references and 'take()' to move the next node safely.

Practice

1. What does inserting at a specific position in a doubly linked list involve?

easy

A. Adjusting the previous and next pointers of nodes around the position

B. Only changing the head pointer of the list

C. Reversing the entire list before insertion

D. Deleting the node at that position first

Solution

1. Step 1: Understand doubly linked list node connections

   Each node has pointers to both previous and next nodes, so insertion requires updating these pointers around the insertion point.

2. Step 2: Adjust pointers for insertion

   To insert at a specific position, update the previous node's next pointer and the next node's previous pointer to point to the new node.

3. Final Answer:

   Adjusting the previous and next pointers of nodes around the position -> Option A

4. Quick Check:

   Pointer updates = Adjust previous and next pointers [OK]

Hint: Remember: update both previous and next pointers [OK]

Common Mistakes:

• Only updating one pointer and ignoring the other
• Not handling edge cases like inserting at head or tail
• Forgetting to update the new node's pointers

2. Which Rust code snippet correctly declares a doubly linked list node struct for insertion?

easy

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

B. struct Node { data: i32, prev: Option<*mut Node>, next: Option<*mut Node> }

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

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

Solution

1. Step 1: Understand Rust ownership for doubly linked lists

   Doubly linked lists require shared ownership and mutability, so Rc is used to allow multiple owners and interior mutability.

2. Step 2: Identify correct pointer types

   Option> allows optional pointers with shared ownership and mutability, suitable for prev and next pointers.

3. Final Answer:

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

4. Quick Check:

   Use Rc<RefCell> for shared mutable pointers [OK]

Hint: Use Rc<RefCell> for doubly linked list nodes in Rust [OK]

Common Mistakes:

• Using Box without Rc causes ownership errors
• Using raw pointers without unsafe code
• Not wrapping pointers in Option for nullable links

3. Given this Rust code snippet inserting a node at position 2 in a doubly linked list with nodes 1 <-> 3, what is the list after insertion of node 2?

medium

A. 3 <-> 2 <-> 1

B. 2 <-> 1 <-> 3

C. 1 <-> 2 <-> 3

D. 1 <-> 3 <-> 2

Solution

1. Step 1: Identify insertion position and existing list

   The list is 1 <-> 3, and we insert node 2 at position 2, meaning after node 1 and before node 3.

2. Step 2: Insert node 2 between nodes 1 and 3

   Update node 1's next to node 2, node 2's prev to node 1, node 2's next to node 3, and node 3's prev to node 2.

3. Final Answer:

   1 <-> 2 <-> 3 -> Option C

4. Quick Check:

   Insert at position 2 places node 2 between 1 and 3 [OK]

Hint: Insert node between previous and next nodes at position [OK]

Common Mistakes:

• Inserting node at wrong position
• Not updating both prev and next pointers
• Confusing position indexing starting at 0 or 1

4. In this Rust code for inserting at position 3, the program panics with 'index out of bounds'. What is the likely cause?

medium

A. The new node's pointers are not initialized

B. The list has fewer than 2 nodes, so position 3 is invalid

C. The head pointer is null

D. The insertion code forgets to update the tail pointer

Solution

1. Step 1: Analyze the error message and position

   The panic 'index out of bounds' means the code tried to access a position beyond the list length. Position 3 requires at least 2 nodes before it.

2. Step 2: Check list length against insertion position

   If the list has fewer than 2 nodes, position 3 is invalid, causing the panic.

3. Final Answer:

   The list has fewer than 2 nodes, so position 3 is invalid -> Option B

4. Quick Check:

   Position > list length causes index out of bounds [OK]

Hint: Check list length before inserting at position [OK]

Common Mistakes:

• Not validating position against list length
• Assuming tail pointer updates fix index errors
• Ignoring null or empty list cases

5. You have a doubly linked list with nodes 10 <-> 20 <-> 30. Write the steps to insert a node with value 25 at position 3 and show the final list.

hard

A. 25 <-> 10 <-> 20 <-> 30

B. 10 <-> 25 <-> 20 <-> 30

C. 10 <-> 20 <-> 30 <-> 25

D. 10 <-> 20 <-> 25 <-> 30

Solution

1. Step 1: Locate position 3 in the list

   Position 3 means the new node goes after the second node (20) and before the third node (30).

2. Step 2: Update pointers to insert node 25

   Set node 20's next to new node 25, new node 25's prev to node 20, new node 25's next to node 30, and node 30's prev to new node 25.

3. Final Answer:

   10 <-> 20 <-> 25 <-> 30 -> Option D

4. Quick Check:

   Insert at position 3 places 25 between 20 and 30 [OK]

Hint: Insert between nodes at position - 1 and position [OK]

Common Mistakes:

• Inserting node at wrong position
• Not updating both prev and next pointers correctly
• Confusing position indexing starting at 0 or 1