Tree vs Array vs Linked List When Hierarchy Matters in DSA Rust - Key Differences

Recall & Review

beginner

What is the main difference between a tree and an array when representing data?

A tree shows hierarchical relationships with parent and child nodes, while an array stores elements in a flat, linear order without hierarchy.

beginner

Why might a linked list be less suitable than a tree for hierarchical data?

A linked list is a linear structure where each element points to the next, so it cannot naturally represent branching or multiple levels like a tree can.

beginner

In what scenario is an array preferred over a tree or linked list?

When data is simple, ordered, and hierarchy does not matter, arrays are preferred for fast access by index and simple storage.

intermediate

How does a tree structure help when hierarchy matters in data?

A tree allows each node to have multiple children, representing complex relationships and levels, making it ideal for hierarchical data like file systems or organization charts.

intermediate

What is a key limitation of arrays when trying to represent hierarchical data?

Arrays cannot directly represent parent-child relationships or branching; they only store elements in a sequence, so extra logic is needed to simulate hierarchy.

Which data structure naturally represents hierarchical relationships?

A Array

B Tree

C Linked List

D Stack

Trees have nodes with parent-child links, making them ideal for hierarchy.

What is a main disadvantage of using a linked list for hierarchical data?

A It has slow access by index

B It uses too much memory

C It only supports linear connections

D It cannot store data

Linked lists connect nodes in a single line, so they can't represent branches.

When is an array the best choice?

A When data is hierarchical

B When data changes frequently

C When data has many branches

D When fast indexed access is needed

Arrays provide fast access by index but do not represent hierarchy.

Which structure allows nodes to have multiple children?

A Tree

B Linked List

C Array

D Queue

Trees allow each node to have multiple child nodes.

What extra work is needed to represent hierarchy in an array?

A Use indexes or pointers to simulate parent-child links

B No extra work needed

C Convert array to linked list

D Sort the array

Arrays need additional logic like indexes or pointers to simulate hierarchy.

Explain how trees, arrays, and linked lists differ when representing hierarchical data.

Think about how each structure connects elements.

Describe a real-life example where a tree is better than an array or linked list.

Consider structures with branching paths.

Practice

1. Which data structure is best to represent a hierarchy where each element can have multiple children, like a company organizational chart?

easy

A. Stack

B. Array

C. Linked List

D. Tree

Solution

1. Step 1: Understand hierarchy representation

   A hierarchy with multiple children per element needs a structure that can link one parent to many children.

2. Step 2: Compare data structures

   Arrays and linked lists are linear and do not naturally represent multiple children. Trees allow each node to have multiple children, fitting the hierarchy.

3. Final Answer:

   Tree -> Option D

4. Quick Check:

   Hierarchy with multiple children = Tree [OK]

Hint: Use trees for multi-child hierarchies, arrays for flat data [OK]

Common Mistakes:

• Choosing array for hierarchical data
• Using linked list which is linear
• Confusing stack with hierarchy

2. Which of the following Rust code snippets correctly declares a linked list node struct with a value and a next pointer?

easy

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

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

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

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

Solution

1. Step 1: Understand Rust linked list node

   Linked list nodes need a pointer to the next node. Rust uses Option for nullable heap pointers.

2. Step 2: Check each option

   A uses direct Node which causes infinite size error. C uses reference without lifetime. D uses Vec which is for multiple children, not linked list.

3. Final Answer:

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

4. Quick Check:

   Linked list node uses Option [OK]

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

Common Mistakes:

• Using direct Node type causing infinite size
• Using references without lifetimes
• Using Vec instead of single next pointer

3. What will be the output of this Rust code that builds a simple tree and prints the root's first child's value?

struct Node {
    value: i32,
    children: Vec<Node>,
}

fn main() {
    let child = Node { value: 10, children: vec![] };
    let root = Node { value: 5, children: vec![child] };
    println!("{}", root.children[0].value);
}

medium

A. 10

B. 5

C. 0

D. Compilation error

Solution

1. Step 1: Understand tree structure and initialization

   Root node has value 5 and one child with value 10 stored in a vector.

2. Step 2: Trace the print statement

   Printing root.children[0].value accesses the first child's value, which is 10.

3. Final Answer:

   10 -> Option A

4. Quick Check:

   root.children[0].value = 10 [OK]

Hint: Access first child value with root.children[0].value [OK]

Common Mistakes:

• Printing root.value instead of child's
• Confusing vector index
• Assuming compilation error due to struct

4. This Rust code tries to create a linked list but fails to compile. What is the main error?

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

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

medium

A. Value type i32 is invalid

B. Missing Option for next pointer to allow None

C. Box cannot be used for recursive types

D. Syntax error in struct definition

Solution

1. Step 1: Identify recursive type issue

   Recursive types in Rust must use Option to allow end of list (None).

2. Step 2: Check code for missing Option

   Code uses Box<Node> without Option, so no way to represent end (None), causing compile error.

3. Final Answer:

   Missing Option for next pointer to allow None -> Option B

4. Quick Check:

   Recursive next pointer needs Option [OK]

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

Common Mistakes:

• Thinking Box alone handles recursion
• Blaming i32 type
• Assuming syntax error in struct

5. You want to represent a file system hierarchy in Rust where folders can contain files and other folders. Which data structure and Rust type combination is best suited for this?

hard

A. Array of strings

B. Linked list of file names

C. Tree with enum Node { File(String), Folder(Vec<Node>) }

D. HashMap with file paths as keys

Solution

1. Step 1: Understand file system hierarchy

   Folders can contain files and other folders, so a recursive structure is needed.

2. Step 2: Evaluate data structure options

   Array or linked list can't represent nested folders well. HashMap stores flat keys, not hierarchy. Tree with enum Node allows files and folders recursively.

3. Final Answer:

   Tree with enum Node { File(String), Folder(Vec<Node>) } -> Option C

4. Quick Check:

   Recursive enum tree fits file system hierarchy [OK]

Hint: Use recursive enum tree for nested folders and files [OK]

Common Mistakes:

• Using flat arrays or lists for nested folders
• Using HashMap which is flat key-value
• Not using enum to distinguish files and folders