Node Structure and Pointer Design in DSA Rust

Mental Model

A node holds data and a pointer to the next node, linking pieces like train cars.

Analogy: Imagine a train where each car carries a box (data) and hooks to the next car (pointer).

Node1[data] -> Node2[data] -> Node3[data] -> null

Dry Run Walkthrough

Input: Create a linked list with nodes holding values 10, 20, 30 linked in order

Goal: Build a chain of nodes where each points to the next, ending with null

Step 1: Create first node with value 10 and pointer null

[10 | null]

Why: Start the chain with the first node pointing to nothing

Step 2: Create second node with value 20 and pointer null

[10 | null]   [20 | null]

Why: Prepare the next node before linking

Step 3: Set first node's pointer to second node

[10 | ->] -> [20 | null]

Why: Link first node to second to form chain

Step 4: Create third node with value 30 and pointer null

[10 | ->] -> [20 | null]   [30 | null]

Why: Prepare third node before linking

Step 5: Set second node's pointer to third node

[10 | ->] -> [20 | ->] -> [30 | null]

Why: Complete chain by linking second to third

Result:

[10 | ->] -> [20 | ->] -> [30 | null]

Annotated Code

DSA Rust

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

// Define a Node struct with data and pointer to next node
struct Node {
    data: i32,
    next: Option<Rc<RefCell<Node>>>,
}

impl Node {
    // Create a new node with given data and no next node
    fn new(data: i32) -> Rc<RefCell<Node>> {
        Rc::new(RefCell::new(Node { data, next: None }))
    }
}

fn main() {
    // Step 1: Create first node
    let first = Node::new(10);

    // Step 2: Create second node
    let second = Node::new(20);

    // Step 3: Link first node to second
    first.borrow_mut().next = Some(second.clone());

    // Step 4: Create third node
    let third = Node::new(30);

    // Step 5: Link second node to third
    second.borrow_mut().next = Some(third.clone());

    // Print the linked list
    let mut current = Some(first.clone());
    while let Some(node) = current {
        print!("{} -> ", node.borrow().data);
        current = node.borrow().next.clone();
    }
    println!("null");
}

fn new(data: i32) -> Rc<RefCell<Node>> {

Create a new node wrapped in reference counted pointer for shared ownership

first.borrow_mut().next = Some(second.clone());

Set first node's next pointer to second node to link them

second.borrow_mut().next = Some(third.clone());

Set second node's next pointer to third node to continue chain

while let Some(node) = current {

Traverse nodes by following next pointers until null

Output

10 -> 20 -> 30 -> null

Complexity Analysis

Time: O(n) because printing traverses all n nodes once

Space: O(n) because each node is stored separately in memory

vs Alternative: Compared to arrays, linked nodes allow easy insertion without shifting elements but need extra space for pointers

Edge Cases

Empty list (no nodes)

No nodes to link or print; code handles by not entering traversal loop

DSA Rust

while let Some(node) = current {

Single node list

Next pointer is None; traversal prints single value then stops

DSA Rust

while let Some(node) = current {

When to Use This Pattern

When you need a chain of elements linked by pointers for flexible insertion or deletion, use node structures with pointers.

Common Mistakes

Mistake: Forgetting to set the next pointer, leaving nodes unlinked
Fix: Always assign the next pointer to link nodes explicitly

Mistake: Using plain pointers without ownership management causing memory errors
Fix: Use Rust's Rc and RefCell to manage shared ownership and mutability safely

Summary

It creates nodes that hold data and point to the next node to form a chain.

Use it when you want a flexible list where elements link to each other.

The key is each node stores a pointer to the next, like train cars hooked together.

Practice

1. What is the primary purpose of a next pointer in a singly linked list node structure?

easy

A. To indicate the size of the list

B. To store the data value of the node

C. To point to the next node in the list

D. To point to the previous node in the list

Solution

1. Step 1: Understand the role of pointers in linked lists

   In a singly linked list, each node contains data and a pointer to the next node to maintain the sequence.

2. Step 2: Identify the function of the next pointer

   The next pointer specifically points to the next node, enabling traversal through the list.

3. Final Answer:

   To point to the next node in the list -> Option C

4. Quick Check:

   next pointer = next node address [OK]

Hint: Next pointer always links to the following node [OK]

Common Mistakes:

• Confusing next pointer with previous pointer
• Thinking next stores data instead of address
• Assuming next pointer stores list size

2. Which of the following is the correct Rust syntax to define a singly linked list node struct with a next pointer using Option and Box?

easy

A. struct Node { data: i32, next: Option }

B. struct Node { data: i32, next: &Node }

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

D. struct Node { data: i32, next: Option<&Node> }

Solution

1. Step 1: Recall Rust ownership and pointer rules for linked lists

   Rust requires heap allocation for recursive types, so Box is used to allocate nodes on the heap. The Option type allows for a nullable pointer.

2. Step 2: Analyze each option's correctness

   struct Node { data: i32, next: Box<Node> } lacks Option, so it cannot represent the end of the list (null). struct Node { data: i32, next: Option } correctly uses Option. struct Node { data: i32, next: &Node } uses a reference without lifetime, which is invalid. struct Node { data: i32, next: Option<&Node> } uses a reference inside Option, which is problematic for ownership.

3. Final Answer:

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

4. Quick Check:

   Use Option for nullable heap pointer [OK]

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

Common Mistakes:

• Omitting Option to represent null
• Using references without lifetimes
• Not boxing recursive types

3. Given the following Rust code for a singly linked list node, what will be printed?

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

fn main() {
    let node3 = Node { data: 3, next: None };
    let node2 = Node { data: 2, next: Some(Box::new(node3)) };
    let node1 = Node { data: 1, next: Some(Box::new(node2)) };

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

medium

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

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

C. 1 -> 2 -> null

D. Compilation error due to ownership

Solution

1. Step 1: Trace the linked list construction

   node1 points to node2, node2 points to node3, node3 points to None (end).

2. Step 2: Follow the while loop printing data

   The loop prints current.data and moves to next node until next is None. It prints 1, then 2, then 3, then prints 3 -> null after loop.

3. Final Answer:

   1 -> 2 -> 3 -> null -> Option A

4. Quick Check:

   Traverse nodes in order: 1, 2, 3 [OK]

Hint: Follow next pointers from head to end [OK]

Common Mistakes:

• Confusing order of nodes
• Expecting reverse print
• Thinking ownership causes compile error here

4. Identify the error in this Rust code snippet defining a linked list node:

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

medium

A. Data type i32 is invalid for node data

B. Missing Box to allocate next node on heap

C. Option cannot be used with structs

D. next should be a reference &Node instead

Solution

1. Step 1: Understand recursive struct requirements in Rust

   Rust needs recursive types to use indirection like Box to know size at compile time.

2. Step 2: Analyze the next field type

   Using Option<Node> causes infinite size because Node contains Node directly. It must be Option to compile.

3. Final Answer:

   Missing Box to allocate next node on heap -> Option B

4. Quick Check:

   Recursive structs need Box for next pointer [OK]

Hint: Use Box for recursive node pointers in Rust [OK]

Common Mistakes:

• Omitting Box causes compile error
• Using references without lifetimes
• Thinking Option<Node> is enough

5. You want to design a doubly linked list node in Rust with safe ownership. Which of the following node struct definitions correctly uses pointers to represent prev and next nodes without causing ownership or borrowing errors?

hard

A. struct Node { data: i32, prev: Option, next: Option }

B. struct Node { data: i32, prev: Option<&Node>, next: Option<&Node> }

C. struct Node { data: i32, prev: Option<*mut Node>, next: Option }

D. struct Node { data: i32, prev: Option>, next: Option> }

Solution

1. Step 1: Understand ownership challenges in doubly linked lists

   Doubly linked lists have nodes pointing both ways, causing multiple ownership which Rust's default ownership model disallows.

2. Step 2: Analyze pointer types for safe shared ownership

   struct Node { data: i32, prev: Option, next: Option } uses Box for both prev and next, causing ownership conflicts. struct Node { data: i32, prev: Option<*mut Node>, next: Option } uses raw pointer for prev, unsafe. struct Node { data: i32, prev: Option<&Node>, next: Option<&Node> } uses references without lifetimes, invalid. struct Node { data: i32, prev: Option>, next: Option> } uses Rc allowing multiple owners and interior mutability safely.

3. Final Answer:

   struct Node { data: i32, prev: Option>, next: Option> } -> Option D

4. Quick Check:

   Use Rc and RefCell for safe shared mutable ownership [OK]

Hint: Use Rc for doubly linked list nodes [OK]

Common Mistakes:

• Using Box for both prev and next causes ownership errors
• Using raw pointers without safety
• Using references without lifetimes