Graph vs Tree Key Structural Difference in DSA C# - Compare & Choose

Challenge - 5 Problems

🧠 Conceptual

intermediate

Key Structural Difference Between Graph and Tree

Which of the following best describes the key structural difference between a graph and a tree?

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

B A tree can have cycles, but a graph cannot have cycles.

C A tree is a connected graph with no cycles, while a graph can have cycles and may be disconnected.

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

💡 Hint

Think about connectivity and cycles in both structures.

A tree is a special type of graph that is connected and has no cycles. Graphs are more general and can have cycles and may not be connected.

❓ Predict Output

intermediate

Output of Graph vs Tree Edge Count

What is the output of the following C# code that counts edges in a tree and a graph?

DSA C#

using System;
using System.Collections.Generic;

class Program {
    static void Main() {
        int nodes = 5;
        int treeEdges = nodes - 1;
        int graphEdges = 7;
        Console.WriteLine($"Tree edges: {treeEdges}");
        Console.WriteLine($"Graph edges: {graphEdges}");
    }
}

A

Tree edges: 4
Graph edges: 7

B

Tree edges: 5
Graph edges: 7

C

Tree edges: 4
Graph edges: 5

D

Tree edges: 5
Graph edges: 5

💡 Hint

Recall that a tree with n nodes has exactly n-1 edges.

A tree with 5 nodes has 4 edges. The graph edges count is given as 7.

🔧 Debug

advanced

Identify the Error in Tree Cycle Check Code

What error will the following C# code produce when checking if a tree has a cycle?

DSA C#

using System;
using System.Collections.Generic;

class Program {
    static bool HasCycle(Dictionary<int, List<int>> graph, int node, int parent, HashSet<int> visited) {
        visited.Add(node);
        foreach (var neighbor in graph[node]) {
            if (!visited.Contains(neighbor)) {
                if (HasCycle(graph, neighbor, node, visited)) return true;
            } else if (neighbor != parent) {
                return true;
            }
        }
        return false;
    }

    static void Main() {
        var graph = new Dictionary<int, List<int>> {
            {1, new List<int>{2}},
            {2, new List<int>{1, 3}},
            {3, new List<int>{2, 4}},
            {4, new List<int>{3, 5}},
            {5, new List<int>{4}}
        };
        var visited = new HashSet<int>();
        Console.WriteLine(HasCycle(graph, 1, -1, visited));
    }
}

A StackOverflowException

B True

C KeyNotFoundException

D False

💡 Hint

Check if the graph has any cycles.

The given graph is a tree (no cycles). The code correctly detects no cycles and returns false.

❓ Predict Output

advanced

Output of Adding Edge Creating Cycle in Graph

What will be the output after adding an edge that creates a cycle in the graph?

DSA C#

using System;
using System.Collections.Generic;

class Program {
    static bool HasCycle(Dictionary<int, List<int>> graph, int node, int parent, HashSet<int> visited) {
        visited.Add(node);
        foreach (var neighbor in graph[node]) {
            if (!visited.Contains(neighbor)) {
                if (HasCycle(graph, neighbor, node, visited)) return true;
            } else if (neighbor != parent) {
                return true;
            }
        }
        return false;
    }

    static void Main() {
        var graph = new Dictionary<int, List<int>> {
            {1, new List<int>{2}},
            {2, new List<int>{1, 3}},
            {3, new List<int>{2, 4}},
            {4, new List<int>{3, 5}},
            {5, new List<int>{4}}
        };
        // Add edge creating cycle between 5 and 1
        graph[5].Add(1);
        graph[1].Add(5);
        var visited = new HashSet<int>();
        Console.WriteLine(HasCycle(graph, 1, -1, visited));
    }
}

A True

B False

C KeyNotFoundException

D StackOverflowException

💡 Hint

Adding an edge between 5 and 1 creates a cycle.

The added edge creates a cycle in the graph, so the cycle detection returns true.

🧠 Conceptual

expert

Why Trees Have Exactly One Path Between Any Two Nodes

Why does a tree have exactly one path between any two nodes?

A Because trees have directed edges that prevent multiple paths.

B Because trees are connected and have no cycles, so only one unique path exists between nodes.

C Because trees are disconnected graphs with isolated nodes.

D Because trees allow multiple cycles, which create multiple paths.

💡 Hint

Think about connectivity and cycles in trees.

In a tree, being connected and having no cycles means there is only one unique path between any two nodes.

Practice

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

easy

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

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

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

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

Solution

1. Step 1: Understand the cycle property in trees and graphs

   A tree is a special type of graph that does not contain any cycles, meaning no path loops back to the same node. Graphs, however, can have cycles.

2. Step 2: Analyze the options based on cycle presence

   A tree has no cycles, but a graph can have cycles. correctly states that trees have no cycles while graphs can have cycles. Other options incorrectly describe root presence, edge multiplicity, or directionality.

3. Final Answer:

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

4. Quick Check:

   Cycle presence = Tree no, Graph yes [OK]

Hint: Trees never loop back; graphs can have loops [OK]

Common Mistakes:

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

2. Which of the following C# declarations correctly represents a tree node class with a list of children nodes?

easy

A. public class TreeNode { public int Value; public TreeNode Parent; }

B. public class TreeNode { public int Value; public List<TreeNode> Children; }

C. public class TreeNode { public int Value; public TreeNode[] Edges; }

D. public class TreeNode { public int Value; public Dictionary Neighbors; }

Solution

1. Step 1: Identify the correct structure for tree children

   A tree node typically holds a list of its children nodes, so a List<TreeNode> is appropriate.

2. Step 2: Compare options for children representation

   public class TreeNode { public int Value; public List<TreeNode> Children; } uses List<TreeNode> for children, which is correct. public class TreeNode { public int Value; public TreeNode Parent; } only has a parent reference, not children. public class TreeNode { public int Value; public TreeNode[] Edges; } uses an array named Edges, which is ambiguous. public class TreeNode { public int Value; public Dictionary Neighbors; } uses a dictionary for neighbors, typical for graphs, not trees.

3. Final Answer:

   public class TreeNode { public int Value; public List<TreeNode> Children; } -> Option B

4. Quick Check:

   Children list = public class TreeNode { public int Value; public List<TreeNode> Children; } [OK]

Hint: Trees store children in lists, not dictionaries [OK]

Common Mistakes:

• Using dictionary for tree children
• Confusing parent with children references
• Using ambiguous 'Edges' array for tree nodes

3. Consider the following C# code snippet representing a graph and a tree. What will be the output when checking if the graph contains a cycle?

class Node {
  public int Value;
  public List<Node> Neighbors = new List<Node>();
}

bool HasCycle(Node node, HashSet<Node> visited, Node parent) {
  visited.Add(node);
  foreach (var neighbor in node.Neighbors) {
    if (!visited.Contains(neighbor)) {
      if (HasCycle(neighbor, visited, node)) return true;
    } else if (neighbor != parent) {
      return true;
    }
  }
  return false;
}

// Setup
Node a = new Node { Value = 1 };
Node b = new Node { Value = 2 };
Node c = new Node { Value = 3 };
a.Neighbors.Add(b);
b.Neighbors.Add(a);
b.Neighbors.Add(c);
c.Neighbors.Add(b);
c.Neighbors.Add(a); // extra edge creating a cycle

var visited = new HashSet<Node>();
Console.WriteLine(HasCycle(a, visited, null));

medium

A. true

B. false

C. Compilation error

D. Runtime exception

Solution

1. Step 1: Understand the graph structure and cycle detection

   The graph nodes a, b, c are connected with edges forming a cycle because c links back to a, creating a loop.

2. Step 2: Trace the HasCycle function call

   The function uses DFS and detects a back edge when it finds a neighbor already visited that is not the parent, confirming a cycle exists.

3. Final Answer:

   true -> Option A

4. Quick Check:

   Cycle detected = true [OK]

Hint: Cycle if visited neighbor not parent found [OK]

Common Mistakes:

• Ignoring the extra edge creating the cycle
• Confusing parent node in cycle check
• Assuming no cycles in undirected graphs

4. The following C# code attempts to check if a tree has cycles. Identify the bug:

bool IsTree(Node node, HashSet<Node> visited, Node parent) {
  if (visited.Contains(node)) return false;
  visited.Add(node);
  foreach (var neighbor in node.Neighbors) {
    if (neighbor != parent) {
      if (!IsTree(neighbor, visited, node)) return false;
    }
  }
  return true;
}

medium

A. Returns false on revisiting a node instead of true for cycle detection.

B. Does not add the current node to visited set.

C. Does not check for null neighbors list.

D. Incorrectly compares neighbor with parent node.

Solution

1. Step 1: Analyze the cycle detection logic

   The function returns false if a node is already visited, but this means it treats revisiting as no cycle, which is incorrect.

2. Step 2: Identify correct return for cycle detection

   When a node is revisited (visited.Contains(node) is true), it should return true to indicate a cycle, not false.

3. Final Answer:

   Returns false on revisiting a node instead of true for cycle detection. -> Option A

4. Quick Check:

   Cycle detection return logic incorrect [OK]

Hint: Cycle found if node revisited, return true [OK]

Common Mistakes:

• Returning false instead of true on revisiting
• Not adding nodes to visited set
• Misusing parent node comparison

5. You have a graph represented by adjacency lists. You want to check if it is a tree. Which combination of conditions must be true for the graph to be a tree?

hard

A. The graph is connected and has cycles.

B. The graph has no cycles and has at least N edges.

C. The graph has exactly N edges and is disconnected.

D. The graph is connected and has exactly (N - 1) edges, where N is the number of nodes.

Solution

1. Step 1: Recall tree properties in graph terms

   A tree is a connected graph with no cycles and exactly N-1 edges for N nodes.

2. Step 2: Evaluate options against tree properties

   The graph is connected and has exactly (N - 1) edges, where N is the number of nodes. correctly states the graph must be connected and have N-1 edges. Other options either allow cycles, wrong edge counts, or disconnected graphs.

3. Final Answer:

   The graph is connected and has exactly (N - 1) edges, where N is the number of nodes. -> Option D

4. Quick Check:

   Connected + edges = N-1 [OK]

Hint: Tree = connected + edges = nodes minus one [OK]

Common Mistakes:

• Allowing cycles in trees
• Confusing edge count with nodes
• Ignoring connectivity requirement