Why Linked List Exists and What Problem It Solves in DSA Rust - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

Why use a linked list instead of an array?

Which problem does a linked list solve better than a simple array?

A It uses less memory than arrays because it stores fewer elements.

B It provides faster access to elements by index compared to arrays.

C It allows efficient insertion and deletion of elements anywhere without shifting other elements.

D It automatically sorts elements as they are added.

💡 Hint

Think about what happens when you add or remove items in the middle of an array.

Arrays require shifting elements when inserting or deleting in the middle, which is slow. Linked lists use pointers to connect nodes, so insertion and deletion are fast without shifting.

🧠 Conceptual

intermediate

What is a key limitation of arrays that linked lists overcome?

Which limitation of arrays is addressed by using linked lists?

A Arrays have fixed size, while linked lists can grow or shrink dynamically.

B Arrays cannot store numbers, but linked lists can.

C Arrays automatically balance themselves, linked lists do not.

D Arrays do not allow duplicate elements, but linked lists do.

💡 Hint

Think about what happens when you want to add more elements than an array can hold.

Arrays have a fixed size set at creation, so resizing requires creating a new array. Linked lists can grow or shrink by adding or removing nodes without resizing.

❓ Predict Output

advanced

Linked List Node Insertion Output

What is the printed output after inserting nodes in this Rust linked list?

DSA Rust

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

struct LinkedList {
    head: Option<Box<Node>>,
}

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

    fn insert_front(&mut self, val: i32) {
        let new_node = Box::new(Node {
            value: val,
            next: self.head.take(),
        });
        self.head = Some(new_node);
    }

    fn print_list(&self) {
        let mut current = &self.head;
        while let Some(node) = current {
            print!("{} -> ", node.value);
            current = &node.next;
        }
        print!("null\n");
    }
}

fn main() {
    let mut list = LinkedList::new();
    list.insert_front(10);
    list.insert_front(20);
    list.insert_front(30);
    list.print_list();
}

A 30 -> 20 -> 10 -> null

B 10 -> 20 -> 30 -> null

C null

D 30 -> 10 -> 20 -> null

💡 Hint

New nodes are added at the front, so the last inserted node appears first.

Each new node is inserted at the front, so the list order is last inserted to first inserted: 30, then 20, then 10.

❓ Predict Output

advanced

Linked List Deletion Effect on Output

What is the output after deleting the first node from this linked list?

DSA Rust

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

struct LinkedList {
    head: Option<Box<Node>>,
}

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

    fn insert_front(&mut self, val: i32) {
        let new_node = Box::new(Node {
            value: val,
            next: self.head.take(),
        });
        self.head = Some(new_node);
    }

    fn delete_front(&mut self) {
        if let Some(node) = self.head.take() {
            self.head = node.next;
        }
    }

    fn print_list(&self) {
        let mut current = &self.head;
        while let Some(node) = current {
            print!("{} -> ", node.value);
            current = &node.next;
        }
        print!("null\n");
    }
}

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

A null

B 3 -> 2 -> 1 -> null

C 1 -> 2 -> null

D 2 -> 1 -> null

💡 Hint

Deleting the front removes the first inserted node at the head.

Initially, nodes are 3 -> 2 -> 1 -> null. Deleting front removes 3, so list becomes 2 -> 1 -> null.

🧠 Conceptual

expert

Why Linked Lists Are Not Always Better Than Arrays

Which of the following is a disadvantage of linked lists compared to arrays?

A Linked lists provide faster random access to elements by index.

B Linked lists use extra memory for storing pointers, increasing memory usage.

C Linked lists automatically compress data to save space.

D Linked lists cannot grow or shrink dynamically.

💡 Hint

Think about what extra information each node in a linked list must store.

Each node in a linked list stores a pointer to the next node, which uses extra memory compared to arrays that store only data.

Practice

1. Why do we use a linked list instead of an array in some cases?

easy

A. Because linked lists store elements in contiguous memory locations

B. Because linked lists use less memory than arrays always

C. Because linked lists allow easy insertion and deletion without shifting elements

D. Because linked lists are faster for accessing elements by index

Solution

1. Step 1: Understand array limitations and linked list advantages

   Arrays store elements in contiguous memory, so inserting or deleting in the middle requires shifting elements, which is slow. Linked lists store elements as nodes linked by pointers, so insertion and deletion can be done by changing pointers without shifting.

2. Final Answer:

   Because linked lists allow easy insertion and deletion without shifting elements -> Option C

3. Quick Check:

   Linked list insertion/deletion ease [OK]

Hint: Linked lists excel at insert/delete without shifting [OK]

Common Mistakes:

• Thinking linked lists use less memory always
• Believing linked lists store elements contiguously
• Assuming linked lists are faster for index access

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: Box<Node> }

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

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

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

Solution

1. Step 1: Recall Rust ownership rules and Option usage

   Rust requires recursive types like linked lists to use indirection like Box to allocate on heap. The next pointer can be None if it's the last node, so Option is needed.

2. Final Answer:

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

3. Quick Check:

   Use Option for next pointer [OK]

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

Common Mistakes:

• Using next: Node causes infinite size error
• Using references (&Node) without lifetime causes errors
• Omitting Option causes no way to mark list end

3. What will be the output of the following Rust code that creates a 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 -> 3 -> null

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

C. 1 -> 2 -> null

D. Compilation error due to ownership

Solution

1. Step 1: Trace linked list creation and printing loop

   Nodes are created in reverse order: third (3), second (2), first (1) linking to next. Loop prints current.value then moves to next node until next is None, printing 1, 2, 3 in order.

2. Final Answer:

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

3. Quick Check:

   Print order matches linked list order [OK]

Hint: Follow next pointers to print nodes in order [OK]

Common Mistakes:

• Confusing order and printing reversed
• Expecting compilation error due to ownership
• Stopping loop too early missing last node

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

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

fn main() {
    let mut first = Node { value: 1, next: None };
    let new_node = Node { value: 4, next: Some(Box::new(first)) };
    first = new_node;
}

medium

A. Borrow of moved value `first`

B. Cannot assign to `first` because it is not mutable

C. Recursive type has infinite size without Box

D. No error, code compiles fine

Solution

1. Step 1: Identify actual error

   `first` is declared mutable, so assignment should be allowed and Cannot assign to `first` because it is not mutable is incorrect. The error is `first` is moved into `Box::new(first)` when creating `new_node`, but then `first = new_node` tries to use `first` after the move, causing borrow of moved value.

2. Final Answer:

   Borrow of moved value `first` -> Option A

3. Quick Check:

   Ownership move error [OK]

Hint: Check ownership moves when assigning linked nodes [OK]

Common Mistakes:

• Confusing mutability error with ownership error
• Thinking code compiles fine
• Ignoring ownership rules in Rust

5. You want to implement a linked list in Rust that supports efficient insertion at the front and also allows traversing the list. Which of the following best explains why a linked list is preferred over a vector (array) for this use case?

hard

A. Linked lists store elements contiguously, making traversal faster than vectors

B. Vectors allow O(1) insertion at front but linked lists are simpler to implement

C. Vectors use pointers to link elements, so linked lists are redundant

D. Linked lists allow O(1) insertion at front without reallocating or shifting elements

Solution

1. Step 1: Analyze insertion and traversal complexities

   Vectors require shifting elements or reallocating memory for insertion at front, which is O(n). Linked lists insert at front by changing head pointer and new node's next pointer, which is O(1) without shifting. Traversal in linked lists is sequential via pointers; vectors have contiguous memory but insertion cost is higher at front.

2. Final Answer:

   Linked lists allow O(1) insertion at front without reallocating or shifting elements -> Option D

3. Quick Check:

   Insertion cost at front = O(1) linked list [OK]

Hint: Linked list front insertion is O(1), vector front insertion is O(n) [OK]

Common Mistakes:

• Thinking vectors insert at front in O(1)
• Believing linked lists store elements contiguously
• Confusing pointers in vectors with linked list nodes