Create a Circular Singly Linked List in DSA Rust - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

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

DSA Rust

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

impl Node {
    fn new(data: i32) -> Self {
        Node { data: [1], next: None }
    }
}

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

Adata

B0

CNone

DBox::new(data)

Attempts:

3 left

💡 Hint

Common Mistakes

Assigning None or Box::new(data) instead of the data value.

Using a literal like 0 instead of the parameter.

The new node should store the given data value in its data field.

2fill in blank

medium

Complete the code to link the new node to itself to form a circular list.

DSA Rust

fn create_circular_node(data: i32) -> Box<Node> {
    let mut node = Box::new(Node::new(data));
    node.next = Some([1]);
    node
}

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

Anode

BBox::new(Node { data, next: None })

CNone

DBox::new(Node::new(data))

Attempts:

3 left

💡 Hint

Common Mistakes

Creating a new node instead of pointing to the existing one.

Assigning None which breaks the circular link.

To make the list circular, the node's next should point to itself.

3fill in blank

hard

Fix the error in the method to insert a new node after the head in the circular list.

DSA Rust

impl Node {
    fn insert_after(&mut self, data: i32) {
        let mut new_node = Box::new(Node::new(data));
        new_node.next = self.next.take();
        self.next = Some([1]);
    }
}

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

ABox::new(Node::new(data))

Bself

Cself.next.unwrap()

Dnew_node

Attempts:

3 left

💡 Hint

Common Mistakes

Assigning self or a new node instead of the created new_node.

Using unwrap() which may panic if next is None.

The new_node must be linked after self, so self.next points to new_node.

4fill in blank

hard

Fill both blanks to traverse the circular list and print each node's data once.

DSA Rust

fn print_circular_list(head: &Node) {
    let mut current = head;
    loop {
        println!("{}", current.data);
        current = current.next.as_ref().map(|node| &**node).unwrap();
        if current.data [1] head.data {
            break;
        }
    }
}

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

A>

B!=

C==

D<

Attempts:

3 left

💡 Hint

Common Mistakes

Using '!=' causes infinite loop.

Using comparison operators like '<' or '>' which are incorrect here.

Stop when current's data equals head's data to avoid infinite loop.

5fill in blank

hard

Fill all three blanks to implement a method that deletes the node after the current node in the circular list.

DSA Rust

impl Node {
    fn delete_after(&mut self) {
        if let Some(mut next_node) = self.next.take() {
            self.next = next_node.next.take();
            next_node.next = None; // disconnect deleted node
        }
    }

    fn delete_after_fixed(&mut self) {
        if let Some(mut next_node) = self.next.take() {
            self.next = next_node.[1].take();
            next_node.[2] = [3]; // disconnect deleted node
        }
    }
}

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

Anext

CNone

Ddata

Attempts:

3 left

💡 Hint

Common Mistakes

Using wrong field names like 'data' instead of 'next'.

Not setting the disconnected node's next to None.

To delete the node after self, assign self.next to next_node.next.take(), then disconnect next_node.next by setting it to None.

Practice

1. What distinguishes a circular singly linked list from a regular singly linked list?

easy

A. Circular lists have two pointers per node

B. The last node's next pointer points back to the head instead of None

C. Circular lists store data in reverse order

D. Each node stores a reference to both its predecessor and successor

Solution

1. Step 1: Regular linked list

   In a regular singly linked list, the last node's next is None - marking the end.

2. Step 2: Circular difference

   In a circular singly linked list, the last node's next points back to the head. There is no None terminator - traversal wraps around.

3. Final Answer:

   Last node points back to head. -> Option B

4. Quick Check:

   Circular = last.next → head (not None). [OK]

Hint: Circular = last node's next points to head, not None. [OK]

Common Mistakes:

• Confusing with doubly linked list (two pointers per node)
• Thinking circular means reverse storage
• Confusing circular with bidirectional

2. What is the time complexity of inserting a node at the end of a circular singly linked list when you maintain a tail pointer?

easy

A. O(n)

B. O(log n)

C. O(1)

D. O(n²)

Solution

1. Step 1: With tail pointer

   tail.next = new_node (new last). new_node.next = head (circular link). tail = new_node. All O(1) pointer updates.

2. Step 2: Without tail pointer

   Would need O(n) traversal to find the last node.

3. Final Answer:

   O(1) with tail pointer maintained. -> Option C

4. Quick Check:

   Tail pointer = O(1) insert at end. Without tail = O(n). [OK]

Hint: Tail pointer = O(1) end insertion. Always maintain tail for circular lists. [OK]

Common Mistakes:

• Saying O(n) because traversal is needed without tail pointer
• Not knowing tail pointer eliminates the traversal
• Confusing with insertion at arbitrary position which is O(n)

3. In Rust, why is creating a circular linked list with safe Box<T> impossible without additional indirection?

medium

A. Box<T> doesn't support linked lists

B. Box<T> implies unique ownership - a circular structure requires the last node to own the first, creating a cycle that Box cannot express

C. Rust doesn't allow struct self-reference

D. Box<T> is only for heap allocation, not pointer structures

Solution

1. Step 1: Box ownership

   Box<T> gives unique ownership of heap data. The last node would need to own the head node.

2. Step 2: Circular ownership cycle

   But the head is also owned by the list itself. Two owners of the same node = illegal in Rust. Box cannot express shared or circular ownership.

3. Step 3: Solution

   Use Rc for shared ownership, or raw pointers with unsafe, or index-based representation with Vec.

4. Final Answer:

   Box implies unique ownership - circular structure needs shared ownership (Rc) or unsafe raw pointers. -> Option B

5. Quick Check:

   Circular = shared ownership. Box = unique ownership. Mismatch. [OK]

Hint: Circular needs shared ownership. Box=unique. Use Rc> or raw pointers. [OK]

Common Mistakes:

• Thinking Box can handle any heap structure
• Not knowing Rust's ownership applies to data structure design
• Confusing Box limitations with general Rust limitations

4. How do you detect that you've completed a full traversal of a circular singly linked list?

medium

A. Check if current.next is None

B. Check if current.next points to the head node

C. Count nodes until reaching n

D. Check if current equals the tail node

Solution

1. Step 1: No None terminator

   Circular lists have no None - checking next is None never terminates traversal.

2. Step 2: Termination condition

   Start at head. Advance. Stop when current.next == head (back at start). This means we've visited all nodes exactly once.

3. Final Answer:

   Stop when current.next points to head. -> Option B

4. Quick Check:

   Circular traversal: stop when next == head, not when next is None. [OK]

Hint: Circular traversal: loop until current.next == head. Never check for None. [OK]

Common Mistakes:

• Checking for None which never occurs in circular lists
• Using a fixed count which breaks for unknown lengths
• Stopping at tail instead of checking if next == head

5. When inserting a new node at the beginning of a circular singly linked list (given head and tail), what pointer update is critical?

hard

A. Update new_node.next to None

B. Update tail.next to point to new_node (the new head)

C. Update head.next to point to new_node

D. Set tail to new_node

Solution

1. Step 1: Current state

   tail.next → head (circular link). new_node will become the new head.

2. Step 2: Required updates

   new_node.next = old_head. tail.next = new_node (maintains circular link to new head). Update head = new_node.

3. Step 3: Critical update

   tail.next must point to new_node - otherwise the circular link points to the old head, breaking the list.

4. Final Answer:

   Update tail.next to new_node to maintain the circular link. -> Option B

5. Quick Check:

   Insert at front: new.next=old_head, tail.next=new (critical!), head=new. [OK]

Hint: Insert at front: tail.next must update to new head - the circular link must be maintained. [OK]

Common Mistakes:

• Forgetting to update tail.next, breaking the circular structure
• Setting tail to new_node (tail should stay at end)
• Setting new_node.next to None instead of old head