Insert at End of Circular Linked List in DSA Rust - Execution Trace

Concept Flow - Insert at End of Circular Linked List

Create new node

↓

Is list empty?

Yes→new_node.next = new_node

↓

head = new_node

↓

Start at head

↓

Traverse until current.next == head

↓

Set current.next = new_node

↓

Set new_node.next = head

↓

Done

Create a new node, if list empty point it to itself. Otherwise, find last node and insert new node after it, linking back to head.

Execution Sample

DSA Rust

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

// Insert at end of circular linked list

This code inserts a new node at the end of a circular linked list, maintaining the circular link.

Execution Table

Step	Operation	Nodes in List	Pointer Changes	Visual State
1	Create new node with data=40	10 -> 20 -> 30 (circular)	new_node.next = None	┌────────┐ ┌────────┐ ┌────────┐ │ data:10│ │ data:20│ │ data:30│ │ next:──┼──→ │ next:──┼──→ │ next:──┼──→ head └────────┘ └────────┘ └────────┘
2	Start traversal at head (10)	10 -> 20 -> 30 (circular)	current = head (10)	Same as above
3	Check current.next != head (20 != 10)	10 -> 20 -> 30 (circular)	Move current to 20	┌────────┐ ┌────────┐ ┌────────┐ │ data:10│ │ data:20│ │ data:30│ │ next:──┼──→ │ next:──┼──→ │ next:──┼──→ head └────────┘ └────────┘ └────────┘ ^ current
4	Check current.next != head (30 != 10)	10 -> 20 -> 30 (circular)	Move current to 30	┌────────┐ ┌────────┐ ┌────────┐ │ data:10│ │ data:20│ │ data:30│ │ next:──┼──→ │ next:──┼──→ │ next:──┼──→ head └────────┘ └────────┘ └────────┘ ^ current
5	current.next == head, insert new_node after current	10 -> 20 -> 30 -> 40 (circular)	current.next = new_node new_node.next = head	BEFORE: ┌────────┐ ┌────────┐ ┌────────┐ │ data:10│ │ data:20│ │ data:30│ │ next:──┼──→ │ next:──┼──→ │ next:──┼──→ head └────────┘ └────────┘ └────────┘ ^ current AFTER: ┌────────┐ ┌────────┐ ┌────────┐ ┌────────┐ │ data:10│ │ data:20│ │ data:30│ │ data:40│ │ next:──┼──→ │ next:──┼──→ │ next:──┼──→ │ next:──┼──→ head └────────┘ └────────┘ └────────┘ └────────┘
6	Done	10 -> 20 -> 30 -> 40 (circular)	No changes	Final circular list with 4 nodes

💡 Traversal stops when current.next points back to head, new node inserted after current.

Variable Tracker

Variable	Start	After Step 2	After Step 3	After Step 4	After Step 5	Final
new_node.data	N/A	40	40	40	40	40
new_node.next	None	None	None	None	head (10)	head (10)
current	N/A	head (10)	node 20	node 30	node 30	node 30
list size	3	3	3	3	4	4

Key Moments - 3 Insights

Why do we check current.next == head to stop traversal?

Because in a circular linked list, the last node points back to head. Checking current.next == head means current is the last node. See execution_table step 5.

What happens if the list is empty when inserting?

If empty, new_node.next points to itself, making a single-node circular list. This is not shown in this trace but is the base case in concept_flow.

Why do we update new_node.next to head after insertion?

To maintain the circular link so the new last node points back to head. See pointer changes in execution_table step 5.

Visual Quiz - 3 Questions

Look at the execution_table at step 4, which node is 'current' pointing to?

A Node with data 30

B Node with data 20

C Node with data 10

D Node with data 40

💡 Hint

Check the 'Pointer Changes' and 'Visual State' columns at step 4.

At which step does the new node get linked into the list?

A Step 2

B Step 5

C Step 3

D Step 6

💡 Hint

Look for pointer changes involving new_node in the execution_table.

If the list was empty, what would new_node.next point to after insertion?

A Head node

B None

C Itself (new_node)

D Previous last node

💡 Hint

Refer to concept_flow step for empty list case.

Concept Snapshot

Insert at End of Circular Linked List:
- Create new node
- If list empty: new_node.next = new_node (points to itself)
- Else traverse to last node (current.next == head)
- Set current.next = new_node
- Set new_node.next = head
- Maintains circular link

Full Transcript

To insert at the end of a circular linked list, first create a new node. If the list is empty, point the new node's next to itself, making a single-node circular list. Otherwise, start at the head and traverse nodes until you find the last node, identified when current.next points back to head. Then, set the last node's next pointer to the new node, and set the new node's next pointer back to head. This keeps the list circular. The execution table shows each step, including pointer changes and the visual state of the list. Key moments clarify why traversal stops at current.next == head and how the circular link is maintained.

Practice

1. What is the main difference between a circular linked list and a regular singly linked list?

easy

A. In a circular linked list, the last node points back to the first node.

B. In a circular linked list, nodes have two pointers instead of one.

C. In a circular linked list, nodes are stored in an array.

D. In a circular linked list, nodes cannot be inserted at the end.

Solution

1. Step 1: Understand the structure of a circular linked list

   A circular linked list connects the last node back to the first node, forming a circle.

2. Step 2: Compare with a regular singly linked list

   A regular singly linked list ends with a node pointing to null, not back to the first node.

3. Final Answer:

   In a circular linked list, the last node points back to the first node. -> Option A

4. Quick Check:

   Circular linked list last node points to head [OK]

Hint: Remember: circular means last node loops to first [OK]

Common Mistakes:

• Thinking circular lists have two pointers per node
• Confusing circular linked list with doubly linked list
• Assuming circular lists cannot have end insertions

2. Which of the following Rust code snippets correctly creates a new node and inserts it at the end of a circular linked list?

easy

A. let new_node = Node::new(data); new_node.next = None; tail.next = Some(new_node); tail = new_node;

B. let new_node = Node::new(data); new_node.next = head; tail.next = Some(new_node); tail = new_node;

C. let new_node = Node::new(data); new_node.next = tail; head.next = Some(new_node); tail = new_node;

D. let new_node = Node::new(data); new_node.next = head; head.next = Some(new_node); tail = new_node;

Solution

1. Step 1: Create new node and link to head

   In a circular linked list, the new node's next should point to head to maintain the circle.

2. Step 2: Update tail's next and tail pointer

   Tail's next should point to the new node, and tail should be updated to new node.

3. Final Answer:

   let new_node = Node::new(data); new_node.next = head; tail.next = Some(new_node); tail = new_node; -> Option B

4. Quick Check:

   New node points to head, tail updated [OK]

Hint: New node's next must point to head in circular list [OK]

Common Mistakes:

• Setting new node's next to None breaks the circle
• Linking new node to tail instead of head
• Not updating tail pointer after insertion

3. Given the following Rust code for inserting at the end of a circular linked list, what will be the printed output after inserting 4 into the list 1 -> 2 -> 3 -> (back to 1)?

fn print_list(head: &Option) {
    let mut temp = head.as_ref();
    if temp.is_none() { return; }
    let start = temp.unwrap();
    loop {
        print!("{} -> ", temp.unwrap().data);
        temp = temp.unwrap().next.as_ref();
        if temp.is_none() || temp.unwrap().data == head.as_ref().unwrap().data { break; }
    }
    println!("null");
}

// After insertion of 4 at end
// List structure: 1 -> 2 -> 3 -> 4 -> (back to 1)

medium

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

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

C. 1 -> 2 -> 3 -> 4 -> null

D. 4 -> 1 -> 2 -> 3 -> null

Solution

1. Step 1: Understand the print loop logic

   The loop prints nodes until it reaches the head again, then breaks to avoid infinite loop.

2. Step 2: Trace the list after insertion

   After inserting 4 at end, list is 1 -> 2 -> 3 -> 4 -> back to 1. The print stops before repeating head.

3. Final Answer:

   1 -> 2 -> 3 -> 4 -> null -> Option C

4. Quick Check:

   Print stops before repeating head [OK]

Hint: Print stops before repeating head node [OK]

Common Mistakes:

• Printing the head node twice causing infinite loop
• Not breaking loop on head node detection
• Confusing order of nodes after insertion

4. The following Rust code attempts to insert a new node at the end of a circular linked list but causes a runtime error. What is the error?

fn insert_end(tail: &mut Option, data: i32) {
    let mut new_node = Box::new(Node::new(data));
    new_node.next = None;
    if tail.is_none() {
        *tail = Some(new_node);
        tail.as_mut().unwrap().next = tail.clone();
    } else {
        new_node.next = tail.as_ref().unwrap().next.clone();
        tail.as_mut().unwrap().next = Some(new_node);
        *tail = tail.as_mut().unwrap().next.clone();
    }
}

medium

A. Using tail.clone() causes ownership issues leading to runtime panic.

B. Setting new_node.next to None breaks the circular link causing infinite loop.

C. Assigning *tail = tail.as_mut().unwrap().next.clone() causes borrow checker error.

D. Not updating tail pointer after insertion causes stale tail reference.

Solution

1. Step 1: Analyze tail.clone() usage

   Cloning tail (which is an Option) duplicates ownership, which Rust forbids at runtime for Box.

2. Step 2: Understand Rust ownership rules

   Box pointers cannot be cloned freely; this causes runtime panic or compile error due to ownership violation.

3. Final Answer:

   Using tail.clone() causes ownership issues leading to runtime panic. -> Option A

4. Quick Check:

   Cloning Box without proper ownership causes error [OK]

Hint: Avoid cloning Box pointers; use references or Rc instead [OK]

Common Mistakes:

• Setting next to None breaking circularity
• Ignoring Rust ownership and cloning rules
• Not updating tail pointer correctly

5. You have a circular linked list with nodes containing values [10, 20, 30]. You want to insert a new node with value 25 at the end, but also maintain a sorted order in the circular list. Which approach correctly inserts 25 while keeping the list sorted?

hard

A. Replace the last node's value with 25 without changing links.

B. Insert 25 at the end and then sort the entire list.

C. Insert 25 at the head and update tail to new node.

D. Traverse the list to find the correct position and insert 25 there, updating links accordingly.

Solution

1. Step 1: Understand sorted circular linked list insertion

   To keep the list sorted, find the correct position where 25 fits between nodes.

2. Step 2: Insert node at correct position and update links

   Traverse nodes until finding node with value less than 25 and next node greater than 25, then insert new node there.

3. Step 3: Update tail if inserted at end

   If inserted after the current tail, update tail pointer to new node to maintain list integrity.

4. Final Answer:

   Traverse the list to find the correct position and insert 25 there, updating links accordingly. -> Option D

5. Quick Check:

   Insert at sorted position to keep order [OK]

Hint: Insert at correct sorted position, not just at end [OK]

Common Mistakes:

• Inserting at end without sorting breaks order
• Replacing node value loses data integrity
• Not updating tail when inserting at end