Creating a Singly Linked List from Scratch in DSA Rust - Code Step by Step

Practice - 5 Tasks

1fill in blank

easy

Complete the code to define the Node struct with a value and a next pointer.

DSA Rust

struct Node<T> {
    value: T,
    next: [1],
}

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

AOption<Node<T>>

BOption<Box<Node<T>>>

CNode<T>

DBox<Node<T>>

Attempts:

3 left

💡 Hint

Common Mistakes

Using Box> without Option causes infinite size error.

Using Node directly causes recursive type without indirection.

The next pointer should be an Option wrapping a Box to allow for nullable and heap allocation.

2fill in blank

medium

Complete the code to create a new Node with given value and no next node.

DSA Rust

impl<T> Node<T> {
    fn new(value: T) -> Self {
        Node {
            value,
            next: [1],
        }
    }
}

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

ABox::new(None)

BSome(Box::new(Node::new(value)))

CNone

DSome(None)

Attempts:

3 left

💡 Hint

Common Mistakes

Using Some(Box::new(...)) causes infinite recursion.

Using Box::new(None) is invalid because None is not a Box.

The next pointer should be None when creating a new node with no next node.

3fill in blank

hard

Fix the error in the push method to add a new node at the front of the list.

DSA Rust

impl<T> LinkedList<T> {
    fn push(&mut self, value: T) {
        let mut new_node = Box::new(Node::new(value));
        new_node.next = [1];
        self.head = Some(new_node);
    }
}

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

Aself.head

Bself.tail

CNone

Dnew_node

Attempts:

3 left

💡 Hint

Common Mistakes

Setting next to None loses the rest of the list.

Setting next to tail is incorrect for singly linked list front insertion.

To insert at the front, the new node's next should point to the current head.

4fill in blank

hard

Fill both blanks to implement a method that checks if the list is empty.

DSA Rust

impl<T> LinkedList<T> {
    fn is_empty(&self) -> bool {
        self.head [1] [2]
    }
}

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

A==

B!=

CNone

DSome

Attempts:

3 left

💡 Hint

Common Mistakes

Using != None returns true when list has nodes.

Using Some instead of None causes logic error.

The list is empty if head is equal to None.

5fill in blank

hard

Fill all three blanks to implement a method that counts nodes in the list.

DSA Rust

impl<T> LinkedList<T> {
    fn length(&self) -> usize {
        let mut count = 0;
        let mut current = &self.head;
        while let [1]([3]) = current {
            count += 1;
            current = &[2];
        }
        count
    }
}

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

ASome

Bnode.next

Cnode

DNone

Attempts:

3 left

💡 Hint

Common Mistakes

Using None in while let causes loop to never run.

Assigning current to node instead of node.next causes infinite loop.

The while let Some(node) pattern unwraps the current node. Then we move to node.next to continue. The variable node holds the current node.

Practice

1. What is the main purpose of a Singly Linked List in data structures?

easy

A. To store elements in a random order without any links

B. To store elements in a tree-like hierarchical structure

C. To store elements with direct access by index like an array

D. To store elements in a linear order where each element points to the next

Solution

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

   A singly linked list stores elements in nodes where each node points to the next node, forming a chain.

2. Step 2: Compare with other data structures

   Unlike arrays, singly linked lists do not provide direct index access and unlike trees, they have a single linear chain of nodes.

3. Final Answer:

   To store elements in a linear order where each element points to the next -> Option D

4. Quick Check:

   Singly Linked List = Linear chain with next pointers [OK]

Hint: Remember: singly linked list nodes point only forward [OK]

Common Mistakes:

• Confusing linked lists with arrays having direct index access
• Thinking linked lists are hierarchical like trees
• Assuming nodes can point backward in singly linked lists

2. Which of the following is the correct way to define a node struct for a singly linked list in Rust?

easy

A. struct Node { value: i32, next: &Node }

B. struct Node { value: i32, next: Node }

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

D. struct Node { value: i32, next: Vec<Node> }

Solution

1. Step 1: Understand Rust ownership and pointers

   Rust requires heap allocation for recursive types like linked lists, so Box is used to own the next node.

2. Step 2: Analyze each option

   struct Node { value: i32, next: Option } uses Option allowing for a nullable next pointer, which is correct. struct Node { value: i32, next: Node } is invalid because it causes infinite size. struct Node { value: i32, next: &Node } uses a reference without lifetime, which is invalid. struct Node { value: i32, next: Vec<Node> } uses a vector which is not suitable for singly linked list next pointer.

3. Final Answer:

   struct Node { value: i32, next: Option } -> Option C

4. Quick Check:

   Use Option for next pointer in Rust [OK]

Hint: Use Option for nullable next node in Rust [OK]

Common Mistakes:

• Using direct Node type causes infinite size error
• Using references without lifetimes for next pointer
• Using Vec<Node> instead of a single next node pointer

3. What will be the printed output after running this Rust code that creates a singly linked list with values 1, 2, 3 and prints them?

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

fn main() {
    let third = Node { value: 3, next: None };
    let second = Node { value: 2, next: Some(Box::new(third)) };
    let first = Node { value: 1, next: Some(Box::new(second)) };

    let mut current = &first;
    while let Some(ref next_node) = current.next {
        println!("{} ->", current.value);
        current = next_node;
    }
    println!("{} -> null", current.value);
}

medium

A. 1 -> 2 -> null

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

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

D. Compilation error due to borrowing

Solution

1. Step 1: Trace the linked list creation

   Nodes are created in reverse order: third (3, None), second (2, Some(third)), first (1, Some(second)). So the list is 1 -> 2 -> 3 -> null.

2. Step 2: Follow the print loop

   The loop prints current.value followed by '->' while current.next is Some. It prints 1 ->, then 2 ->, then exits loop at 3 (next is None) and prints 3 -> null.

3. Final Answer:

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

4. Quick Check:

   Prints nodes in order from first to last [OK]

Hint: Trace node links from first to last for output [OK]

Common Mistakes:

• Printing nodes in reverse order by mistake
• Missing the last node print with 'null'
• Confusing Option with direct node causing errors

4. Identify the error in this Rust code snippet that tries to create a singly linked list node:

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

fn main() {
    let node1 = Node { value: 1, next: None };
    let node2 = Node { value: 2, next: node1 };
}

medium

A. next field must be Option, but node1 is Node type

B. Missing semicolon after node2 declaration

C. Cannot move node1 because it is not boxed inside Option

D. No error, code compiles fine

Solution

1. Step 1: Check the type of next field

   The next field expects an Option, but node1 is a Node, not wrapped in Box or Option.

2. Step 2: Understand Rust type requirements

   Rust requires the next pointer to be boxed and wrapped in Option to handle ownership and nullability. Directly assigning node1 causes a type mismatch.

3. Final Answer:

   next field must be Option, but node1 is Node type -> Option A

4. Quick Check:

   next must be Option not Node [OK]

Hint: Match next field type exactly: Option [OK]

Common Mistakes:

• Assigning Node directly instead of Option
• Ignoring Rust ownership rules for recursive types
• Assuming semicolon missing causes error here

5. You want to implement a method append to add a new node at the end of a singly linked list in Rust. Which approach correctly handles ownership and mutability to traverse and append the node?

hard

A. Use a mutable reference to Option and loop until next is None, then set next to Some(new_node)

B. Use an immutable reference to Node and assign next directly without mutability

C. Clone the entire list and add the new node at the front

D. Use unsafe pointers to bypass Rust ownership rules

Solution

1. Step 1: Understand Rust ownership and mutability for linked lists

   To modify the list, you need a mutable reference to the next pointer (Option) to traverse and update it safely.

2. Step 2: Analyze each option

   Use a mutable reference to Option and loop until next is None, then set next to Some(new_node) correctly uses mutable references to traverse until the end and then sets next to Some(new_node). Use an immutable reference to Node and assign next directly without mutability uses immutable reference which cannot modify. Clone the entire list and add the new node at the front clones the list which is inefficient and not appending at end. Use unsafe pointers to bypass Rust ownership rules uses unsafe code which is discouraged.

3. Final Answer:

   Use a mutable reference to Option and loop until next is None, then set next to Some(new_node) -> Option A

4. Quick Check:

   Mutable reference to next pointer needed for append [OK]

Hint: Traverse with mutable Option reference to append [OK]

Common Mistakes:

• Using immutable references preventing modification
• Trying to assign next without Option or Box
• Using unsafe code unnecessarily