Graph vs Tree Key Structural Difference in DSA Rust - Build Both Approaches

Graph vs Tree Key Structural Difference

📖 Scenario: Imagine you are organizing a family reunion and a city map. The family reunion is like a tree structure where each person has one parent, but the city map is like a graph where places connect in many ways.

🎯 Goal: You will build simple Rust programs to create a tree and a graph, then observe their key structural difference: trees have no cycles and exactly one path between nodes, while graphs can have cycles and multiple paths.

📋 What You'll Learn

Create a tree using adjacency list representation with 4 nodes

Create a graph using adjacency list representation with 4 nodes including a cycle

Add a variable to count edges in both structures

Print the adjacency lists to show the structure clearly

💡 Why This Matters

🌍 Real World

Trees are used in family trees, file systems, and organization charts. Graphs model city maps, social networks, and internet links.

💼 Career

Understanding trees and graphs is essential for software engineers working on data organization, networking, and algorithms.

1

Create a tree adjacency list

Create a variable called tree as a Vec> with 4 nodes representing a tree structure: node 0 connected to 1 and 2, node 1 connected to 3.

DSA Rust

# Your code here

Hint

Use a vector of vectors to represent adjacency lists for each node.

2

Create a graph adjacency list with a cycle

Add a variable called graph as a Vec> with 4 nodes representing a graph with a cycle: node 0 connected to 1 and 2, node 1 connected to 2 and 3, node 2 connected to 0.

DSA Rust

fn main() {
    let tree: Vec> = vec![
        vec![1, 2], // node 0 connected to 1 and 2
        vec![3],    // node 1 connected to 3
        vec![],     // node 2 no children
        vec![]      // node 3 no children
    ];

    // Your code here
}

Hint

Graph adjacency list can have cycles, so node 2 connects back to node 0.

3

Add edge count variables

Add two variables: tree_edges and graph_edges to count total edges in tree and graph respectively by summing lengths of adjacency lists.

DSA Rust

fn main() {
    let tree: Vec> = vec![
        vec![1, 2], // node 0 connected to 1 and 2
        vec![3],    // node 1 connected to 3
        vec![],     // node 2 no children
        vec![]      // node 3 no children
    ];

    let graph: Vec> = vec![
        vec![1, 2], // node 0 connected to 1 and 2
        vec![2, 3], // node 1 connected to 2 and 3
        vec![0],    // node 2 connected to 0 (cycle)
        vec![]      // node 3 no children
    ];

    // Your code here
}

Hint

Use iter(), map(), and sum() to count edges.

4

Print adjacency lists and edge counts

Print the tree and graph adjacency lists and the edge counts tree_edges and graph_edges using println!.

DSA Rust

fn main() {
    let tree: Vec> = vec![
        vec![1, 2], // node 0 connected to 1 and 2
        vec![3],    // node 1 connected to 3
        vec![],     // node 2 no children
        vec![]      // node 3 no children
    ];

    let graph: Vec> = vec![
        vec![1, 2], // node 0 connected to 1 and 2
        vec![2, 3], // node 1 connected to 2 and 3
        vec![0],    // node 2 connected to 0 (cycle)
        vec![]      // node 3 no children
    ];

    let tree_edges: usize = tree.iter().map(|neighbors| neighbors.len()).sum();
    let graph_edges: usize = graph.iter().map(|neighbors| neighbors.len()).sum();

    // Your code here
}

Hint

Use println!("Tree adjacency list: {:?}", tree); and similar for graph and edge counts.

Practice

1. Which of the following is a key structural difference between a graph and a tree?

easy

A. A tree has no cycles, but a graph can have cycles.

B. A graph always has a root node, but a tree does not.

C. A tree can have multiple edges between the same nodes, but a graph cannot.

D. A graph is always directed, but a tree is always undirected.

Solution

1. Step 1: Understand cycle presence in trees and graphs

   Trees are acyclic by definition, meaning they do not contain any cycles. Graphs can have cycles or be acyclic.

2. Step 2: Analyze other options for correctness

   Graphs do not always have a root node; trees do have a root. Multiple edges can exist in graphs (multigraphs), but trees do not have multiple edges between the same nodes. Both graphs and trees can be directed or undirected.

3. Final Answer:

   A tree has no cycles, but a graph can have cycles. -> Option A

4. Quick Check:

   Cycle presence = Tree no, Graph yes [OK]

Hint: Trees never have cycles; graphs can have cycles [OK]

Common Mistakes:

• Thinking graphs always have a root node
• Believing trees can have cycles
• Confusing directionality rules

2. Which Rust code snippet correctly declares a tree node struct with a parent and children?

easy

A. struct TreeNode { parent: Option<TreeNode>, children: Vec }

B. struct TreeNode { parent: TreeNode, children: Vec<TreeNode> }

C. struct TreeNode { parent: Box<TreeNode>, children: Vec<TreeNode> }

D. struct TreeNode { parent: Option, children: Vec }

Solution

1. Step 1: Understand ownership and optional parent in Rust

   Parent can be None (root node), so Option is needed. Box is used for heap allocation to avoid recursive size issues.

2. Step 2: Check children vector type

   Children are multiple nodes, so Vec is correct to hold multiple heap-allocated nodes.

3. Final Answer:

   struct TreeNode { parent: Option, children: Vec } -> Option D

4. Quick Check:

   Use Option and Box for recursive tree nodes [OK]

Hint: Use Option for optional recursive fields in Rust [OK]

Common Mistakes:

• Using direct TreeNode type causing infinite size error
• Not using Option for nullable parent
• Using Vec<TreeNode> without Box causing stack overflow

3. Given the following Rust code representing a graph adjacency list, what is the output of printing the neighbors of node 1?

let graph = vec![
    vec![1, 2],
    vec![0, 3],
    vec![0],
    vec![1]
];
println!("{:?}", graph[1]);

medium

A. [0, 3]

B. [1, 2]

C. [1, 3]

D. [0, 1]

Solution

1. Step 1: Identify neighbors of node 1 in adjacency list

   graph[1] is the second element: vec![0, 3], meaning node 1 connects to nodes 0 and 3.

2. Step 2: Confirm printed output matches neighbors

   Printing graph[1] outputs [0, 3].

3. Final Answer:

   [0, 3] -> Option A

4. Quick Check:

   Neighbors of node 1 = [0, 3] [OK]

Hint: Index adjacency list by node number to get neighbors [OK]

Common Mistakes:

• Confusing node indices and neighbors
• Printing wrong vector index
• Misreading vector contents

4. Consider this Rust code snippet for a tree structure:

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

fn add_child(parent: &mut Node, child: Node) {
    parent.children.push(child);
}

fn main() {
    let mut root = Node { value: 1, children: vec![] };
    let child = Node { value: 2, children: vec![] };
    add_child(&mut root, child);
    println!("{}", root.children[0].value);
}

What error will this code produce?

medium

A. Compilation error due to recursive struct size

B. Compilation error due to borrowing rules

C. No error; prints 2

D. Runtime panic due to index out of bounds

Solution

1. Step 1: Analyze struct and function usage

   Node struct holds children as Vec<Node>, which is allowed because Vec is heap allocated. add_child pushes child correctly.

2. Step 2: Check main function behavior

   Root node is mutable, child is created and added. Printing root.children[0].value prints 2 without error.

3. Final Answer:

   No error; prints 2 -> Option C

4. Quick Check:

   Vec<Node> allows recursive tree; code runs fine [OK]

Hint: Vec stores heap data; recursive structs allowed [OK]

Common Mistakes:

• Expecting recursive struct size error without Box
• Confusing borrowing errors
• Assuming runtime panic on valid index

5. You want to represent a directed acyclic graph (DAG) in Rust and ensure it has no cycles. Which approach best enforces the key structural difference from a tree?

hard

A. Use a tree struct with parent pointers and children vectors, disallowing cycles by design.

B. Use a graph adjacency list with cycle detection logic during edge insertion.

C. Use a graph with multiple edges allowed and no cycle checks.

D. Use a tree struct but allow cycles by linking nodes arbitrarily.

Solution

1. Step 1: Understand DAG vs Tree structure

   DAGs allow multiple parents but no cycles. Trees have exactly one parent per node except root.

2. Step 2: Evaluate approaches for cycle prevention

   Using adjacency list with cycle detection on edge insertion ensures no cycles, fitting DAG definition. Trees disallow multiple parents, so not suitable for DAGs.

3. Final Answer:

   Use a graph adjacency list with cycle detection logic during edge insertion. -> Option B

4. Quick Check:

   DAG = graph + cycle check [OK]

Hint: Detect cycles on insert to keep DAG acyclic [OK]

Common Mistakes:

• Confusing trees with DAGs
• Ignoring cycle detection in graphs
• Allowing cycles in supposed DAG