Insert at End Tail Insert in DSA Rust

Mental Model

Add a new item at the very end of a chain by following links until the last one.

Analogy: Like adding a new car to the end of a train by walking to the last car and attaching it there.

Head -> 1 -> 2 -> 3 -> null
                 ↑

Dry Run Walkthrough

Input: list: 1 -> 2 -> 3, insert value 4 at end

Goal: Add the value 4 as the last node in the list

Step 1: Start at head node with value 1

Head -> [curr->1] -> 2 -> 3 -> null

Why: We begin traversing from the start to find the last node

Step 2: Move curr to next node with value 2

Head -> 1 -> [curr->2] -> 3 -> null

Why: Keep moving forward to reach the end

Step 3: Move curr to next node with value 3

Head -> 1 -> 2 -> [curr->3] -> null

Why: We found the last node because next is null

Step 4: Create new node with value 4 and link it after curr

Head -> 1 -> 2 -> 3 -> 4 -> null

Why: Attach new node at the end to complete insertion

Result:

Head -> 1 -> 2 -> 3 -> 4 -> null

Annotated Code

DSA Rust

use std::rc::Rc;
use std::cell::RefCell;

#[derive(Debug)]
struct Node {
    val: i32,
    next: Option<Rc<RefCell<Node>>>,
}

impl Node {
    fn new(val: i32) -> Rc<RefCell<Node>> {
        Rc::new(RefCell::new(Node { val, next: None }))
    }
}

struct LinkedList {
    head: Option<Rc<RefCell<Node>>>,
}

impl LinkedList {
    fn new() -> Self {
        LinkedList { head: None }
    }

    fn insert_at_end(&mut self, val: i32) {
        let new_node = Node::new(val);
        if self.head.is_none() {
            self.head = Some(new_node);
            return;
        }
        let mut curr = self.head.as_ref().unwrap().clone();
        // advance curr to last node
        while curr.borrow().next.is_some() {
            let next = curr.borrow().next.as_ref().unwrap().clone();
            curr = next;
        }
        // link new_node at end
        curr.borrow_mut().next = Some(new_node);
    }

    fn print_list(&self) {
        let mut curr_opt = self.head.clone();
        while let Some(curr) = curr_opt {
            print!("{} -> ", curr.borrow().val);
            curr_opt = curr.borrow().next.clone();
        }
        println!("null");
    }
}

fn main() {
    let mut list = LinkedList::new();
    list.insert_at_end(1);
    list.insert_at_end(2);
    list.insert_at_end(3);
    list.insert_at_end(4);
    list.print_list();
}

if self.head.is_none() { self.head = Some(new_node); return; }

handle empty list by setting head to new node

while curr.borrow().next.is_some() { let next = curr.borrow().next.as_ref().unwrap().clone(); curr = next; }

advance curr to last node by following next pointers

curr.borrow_mut().next = Some(new_node);

link new node at the end of the list

Output

1 -> 2 -> 3 -> 4 -> null

Complexity Analysis

Time: O(n) because we traverse all n nodes once to reach the end

Space: O(1) because we only create one new node and use constant extra space

vs Alternative: Compared to inserting at head which is O(1), tail insert requires traversal making it O(n)

Edge Cases

empty list

new node becomes the head

DSA Rust

if self.head.is_none() {
    self.head = Some(new_node);
    return;
}

single element list

new node linked after the single node

DSA Rust

while curr.borrow().next.is_some() {
    let next = curr.borrow().next.as_ref().unwrap().clone();
    curr = next;
}

When to Use This Pattern

When you need to add an item at the end of a linked list, use tail insertion by traversing to the last node and linking the new node there.

Common Mistakes

Mistake: Not checking if the list is empty before traversal
Fix: Add a condition to set head directly if the list is empty

Mistake: Stopping traversal too early before the last node
Fix: Continue moving until current node's next is None to find the true tail

Summary

Adds a new node at the end of a linked list by traversing to the last node and linking it.

Use when you want to keep the existing order and append new data at the tail.

The key is to find the last node by following next pointers until you reach the end.

Practice

1. What does the "Insert at End (Tail Insert)" operation do in a linked list?

easy

A. Deletes the last node of the list

B. Removes the first node of the list

C. Adds a new node at the end of the list

D. Adds a new node at the beginning of the list

Solution

1. Step 1: Understand the operation name

   "Insert at End" means adding a new element at the tail (last position) of the list.

2. Step 2: Compare with other operations

   Adding at the beginning is different; removing nodes is deletion, not insertion.

3. Final Answer:

   Adds a new node at the end of the list -> Option C

4. Quick Check:

   Insert at End = Add node at tail [OK]

Hint: Tail insert always adds node at the list's end [OK]

Common Mistakes:

• Confusing insert at end with insert at beginning
• Thinking it removes nodes instead of adding
• Mixing insertion with deletion operations

2. Which of the following Rust code snippets correctly inserts a new node with value 10 at the end of a singly linked list?

easy

A. let mut current = &mut head;
while current.is_some() {
current = &mut current.as_mut().unwrap().next;
}
*current = Some(Box::new(Node { value: 10, next: None }));

B. head = Some(Box::new(Node { value: 10, next: head }));

C. head = None;

D. let mut current = &head;
while current.is_some() {
current = ¤t.unwrap().next;
}
current = Some(Box::new(Node { value: 10, next: None }));

Solution

1. Step 1: Analyze code for tail insertion

   let mut current = &mut head; while current.is_some() { current = &mut current.as_mut().unwrap().next; } *current = Some(Box::new(Node { value: 10, next: None })); traverses the list using mutable references until it finds None, then inserts the new node.

2. Step 2: Check other options for correctness

   head = Some(Box::new(Node { value: 10, next: head })); inserts at the head, not tail. head = None; clears the list. let mut current = &head; while current.is_some() { current = ¤t.unwrap().next; } current = Some(Box::new(Node { value: 10, next: None })); uses immutable references, causing compilation errors on unwrap() and rebinding, and doesn't modify the list.

3. Final Answer:

   The mutable reference traversal code correctly inserts at the end -> Option A

4. Quick Check:

   Mutable traversal + insert at None = tail insert [OK]

Hint: Use mutable references to find None and insert [OK]

Common Mistakes:

• Using immutable references when mutability is needed
• Inserting at head instead of tail
• Assigning to immutable references causing errors

3. What will be the output of the following Rust code that inserts values 1, 2, 3 at the end of an empty linked list and then prints it?

struct Node {
    value: i32,
    next: Option,
}

fn main() {
    let mut head: Option = None;
    for val in [1, 2, 3] {
        let mut current = &mut head;
        while current.is_some() {
            current = &mut current.as_mut().unwrap().next;
        }
        *current = Some(Box::new(Node { value: val, next: None }));
    }
    let mut current = &head;
    while let Some(node) = current {
        print!("{} -> ", node.value);
        current = &node.next;
    }
    print!("null\n");
}

medium

A. 3 -> 2 -> 1 -> null

B. 1 -> 2 -> 3 -> null

C. null

D. Compilation error

Solution

1. Step 1: Trace insertion loop

   The insertion loop correctly adds 1, then 2, then 3 at the tail, building 1 -> 2 -> 3 -> None.

2. Step 2: Trace print loop

   The print loop uses `let mut current = &head;` and `while let Some(node) = current` which causes a type mismatch because `current` is a reference to an Option, not an Option itself. To fix this, the code should use `current = current.as_ref().map(|node| &node.next)` or `while let Some(node) = current.as_ref()` to correctly traverse the list immutably. However, as given, the code will not compile due to this mismatch.

3. Step 3: Correction

   Assuming the print loop is fixed to use `while let Some(node) = current.as_ref()`, the output will be `1 -> 2 -> 3 -> null`.

4. Final Answer:

   1 -> 2 -> 3 -> null -> Option B

5. Quick Check:

   Tail insertion preserves order; print loop needs as_ref() for immutable traversal [OK]

Hint: Use `as_ref()` chain for immutable print traversal [OK]

Common Mistakes:

• Type mismatch between `&Option` and `Option` in pattern matching
• Forgetting `as_ref()` for immutable list traversal
• Confusing head insertion (reverses order) with tail insertion

4. The following Rust code tries to insert a new node with value 5 at the end of a linked list but causes a compilation error. What is the error?

let mut current = &head;
while current.is_some() {
    current = ¤t.unwrap().next;
}
*current = Some(Box::new(Node { value: 5, next: None }));

medium

A. Cannot assign to `*current` because `current` is an immutable reference

B. `unwrap()` called on None value causing panic

C. Missing semicolon after assignment

D. Node struct is not defined

Solution

1. Step 1: Identify reference mutability

   Variable `current` is an immutable reference to `head`, so `*current = ...` is invalid.

2. Step 2: Understand Rust's mutability rules

   To modify the list, `current` must be a mutable reference (`&mut`).

3. Final Answer:

   Cannot assign to `*current` because `current` is an immutable reference -> Option A

4. Quick Check:

   Mutable reference needed for assignment [OK]

Hint: Use &mut references to modify linked list nodes [OK]

Common Mistakes:

• Using immutable references when mutability is required
• Ignoring Rust's ownership and borrowing rules
• Assuming unwrap causes error here instead of mutability

5. Given a singly linked list in Rust, how would you modify the tail insert function to handle the edge case when the list is initially empty?

hard

A. Replace head with new node regardless of current list state

B. Always traverse the list without checking head, insert at the end

C. Use recursion to insert node at the beginning

D. Check if head is None, then assign new node directly to head; else traverse to tail and insert

Solution

1. Step 1: Handle empty list case

   If head is None, assign the new node directly to head to start the list.

2. Step 2: Handle non-empty list case

   If head exists, traverse to the last node and insert the new node at the end.

3. Final Answer:

   Check if head is None, then assign new node directly to head; else traverse to tail and insert -> Option D

4. Quick Check:

   Empty list needs direct head assignment [OK]

Hint: Always check if list is empty before tail insert [OK]

Common Mistakes:

• Not checking for empty list causing panic
• Overwriting head without condition
• Using recursion incorrectly for tail insertion