Insert at Specific Position in Doubly Linked List in DSA Rust - Time & Space Complexity

Time Complexity: Insert at Specific Position in Doubly Linked List

O(n)

Understanding Time Complexity

We want to understand how the time to insert a new item at a specific place in a doubly linked list changes as the list grows.

How does the number of steps grow when the list gets longer?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

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

fn insert_at_position(head: &mut Option>, pos: usize, data: i32) {
    let mut current = head.as_mut();
    let mut index = 0;
    while let Some(node) = current {
        if index == pos - 1 {
            // Insert logic here
            break;
        }
        current = node.next.as_mut();
        index += 1;
    }
}
    

This code moves through the list to find the right spot, then inserts a new node there.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Traversing the list node by node to reach the position.
• How many times: Up to pos times, which can be as many as the list length n.

How Execution Grows With Input

As the list gets longer, the steps to reach the position grow roughly in a straight line.

Input Size (n)	Approx. Operations
10	Up to 10 steps
100	Up to 100 steps
1000	Up to 1000 steps

Pattern observation: The number of steps grows directly with the list size.

Final Time Complexity

Time Complexity: O(n)

This means the time to insert grows linearly with the list size because we must walk through nodes to find the spot.

Common Mistake

[X] Wrong: "Insertion at any position in a doubly linked list is always fast and constant time."

[OK] Correct: You must first find the position by moving through nodes, which takes time proportional to the position, so it is not always instant.

Interview Connect

Knowing how insertion time depends on list size helps you explain trade-offs in data structures clearly and shows you understand practical costs beyond just the code.

Self-Check

"What if we kept a pointer to the tail and wanted to insert near the end? How would the time complexity change?"

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