Delete Node at Beginning in DSA Rust - Time & Space Complexity

Time Complexity: Delete Node at Beginning

O(1)

Understanding Time Complexity

We want to know how long it takes to remove the first node from a linked list.

How does the time needed change when the list grows bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

struct Node {
    data: i32,
    next: Option>,
}

fn delete_at_beginning(head: &mut Option>) {
    if head.is_some() {
        let next_node = head.as_mut().unwrap().next.take();
        *head = next_node;
    }
}
    

This code removes the first node from a linked list by changing the head pointer to the next node.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Accessing and updating the head pointer once.
• How many times: Exactly one time per call, no loops or recursion.

How Execution Grows With Input

Removing the first node takes the same steps no matter how big the list is.

Input Size (n)	Approx. Operations
10	1
100	1
1000	1

Pattern observation: The work stays the same even if the list grows larger.

Final Time Complexity

Time Complexity: O(1)

This means deleting the first node takes a constant amount of time no matter the list size.

Common Mistake

[X] Wrong: "Deleting the first node takes longer if the list is bigger because we have to check all nodes."

[OK] Correct: We only change the head pointer once; we do not look at other nodes.

Interview Connect

Knowing this helps you explain why some linked list operations are very fast, building confidence in your understanding.

Self-Check

"What if we had to delete the last node instead? How would the time complexity change?"

Practice

1. What does deleting a node at the beginning of a singly linked list do to the list?

easy

A. Deletes all nodes in the list

B. Removes the last node and updates the tail

C. Removes the first node and updates the head to the next node

D. Removes a node from the middle of the list

Solution

1. Step 1: Understand the head pointer role

   The head points to the first node in the list, so deleting the first node means changing the head.

2. Step 2: Update the head to the next node

   After removing the first node, the head should point to the second node, effectively removing the first node from the list.

3. Final Answer:

   Removes the first node and updates the head to the next node -> Option C

4. Quick Check:

   Delete at beginning = remove first node [OK]

Hint: Deleting at start means moving head to next node [OK]

Common Mistakes:

• Trying to remove the last node instead of the first
• Not updating the head pointer after deletion
• Deleting all nodes instead of just one

2. Which Rust code snippet correctly deletes the first node of a singly linked list stored in a variable head?

easy

A. head = head.take().and_then(|node| node.next);

B. head = head.unwrap().next;

C. head = head.next;

D. head.next = head;

Solution

1. Step 1: Understand Rust Option handling for linked lists

   In Rust, linked lists often use Option. To delete the first node, we take the head and replace it with its next node safely.

2. Step 2: Use take() and and_then() to update head

   head.take() removes the current head, and and_then(|node| node.next) sets head to the next node, deleting the first.

3. Final Answer:

   head = head.take().and_then(|node| node.next); -> Option A

4. Quick Check:

   Use take() and and_then() to delete first node [OK]

Hint: Use take() and and_then() to update head safely [OK]

Common Mistakes:

• Trying to assign head.next directly without handling Option
• Using unwrap() which can panic if head is None
• Assigning head.next to head causing infinite loop

3. What will be the output linked list after deleting the first node from this Rust linked list?

let mut head = Some(Box::new(Node { value: 10, next: Some(Box::new(Node { value: 20, next: Some(Box::new(Node { value: 30, next: None })) })) }));
head = head.take().and_then(|node| node.next);

Print the list values in order.

medium

A. []

B. [10, 20, 30]

C. [30]

D. [20, 30]

Solution

1. Step 1: Initial list values

   The list starts as 10 -> 20 -> 30 -> None.

2. Step 2: Delete the first node

   Using head.take().and_then(|node| node.next) removes the node with value 10 and sets head to node with value 20.

3. Final Answer:

   [20, 30] -> Option D

4. Quick Check:

   After deletion, list starts at 20 [OK]

Hint: Deleting first node removes head value [OK]

Common Mistakes:

• Forgetting to update head, so list stays same
• Assuming deletion removes last node
• Confusing node values order after deletion

4. Identify the error in this Rust code that tries to delete the first node of a linked list:

fn delete_first(mut head: Option) -> Option {
    head = head.unwrap().next;
    head
}

medium

A. Using unwrap() without checking if head is None causes panic

B. The function does not return the updated head

C. head.next is assigned incorrectly

D. The function should take &mut head instead of ownership

Solution

1. Step 1: Check unwrap() usage

   Calling unwrap() on an Option that might be None will cause the program to panic at runtime.

2. Step 2: Safe deletion requires handling None

   Before unwrap(), code should check if head is Some or use methods like take() and and_then() to avoid panic.

3. Final Answer:

   Using unwrap() without checking if head is None causes panic -> Option A

4. Quick Check:

   unwrap() on None causes panic [OK]

Hint: Never unwrap() without checking Option first [OK]

Common Mistakes:

• Ignoring possibility of empty list (None)
• Not returning updated head properly
• Confusing ownership and borrowing in function

5. Given a Rust singly linked list where each node contains an integer, write the correct way to delete the first node and return the updated list head. Which code snippet correctly handles the edge case when the list is empty?

hard

A. fn delete_first(head: Option) -> Option {
head.unwrap().next
}

B. fn delete_first(mut head: Option) -> Option {
head = head.take().and_then(|node| node.next);
head
}

C. fn delete_first(head: Option) -> Option {
if head.is_some() {
head.unwrap()
} else {
None
}
}

D. fn delete_first(head: Option) -> Option {
head.next
}

Solution

1. Step 1: Handle Option safely with take() and and_then()

   Using head.take().and_then(|node| node.next) safely removes the first node and returns the next node or None if empty.

2. Step 2: Return updated head

   Assign the result back to head and return it, ensuring the function works for empty and non-empty lists.

3. Final Answer:

   fn delete_first(mut head: Option) -> Option { head = head.take().and_then(|node| node.next); head } -> Option B

4. Quick Check:

   Use take() and and_then() for safe deletion [OK]

Hint: Use take() and and_then() to handle empty list safely [OK]

Common Mistakes:

• Using unwrap() without checking for None
• Accessing head.next directly on Option type
• Not returning the updated head after deletion