Why Graphs Exist and What Trees Cannot Model in DSA Go - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

Why can't trees model all relationships?

Which of the following scenarios cannot be accurately represented by a tree structure?

A A family genealogy where each person has exactly one parent

B A company's organizational chart with one CEO at the top

C A file system directory with folders and subfolders

D A social network where people can be friends with multiple others

💡 Hint

Think about whether nodes can have multiple parents or connections.

Trees have a strict hierarchy where each node has only one parent. Social networks have many-to-many connections, which trees cannot represent.

❓ Predict Output

intermediate

Output of graph adjacency list with cycles

What is the printed adjacency list after adding edges in this Go graph code?

DSA Go

package main
import "fmt"
func main() {
  graph := make(map[int][]int)
  graph[1] = append(graph[1], 2)
  graph[2] = append(graph[2], 3)
  graph[3] = append(graph[3], 1) // cycle here
  fmt.Println(graph)
}

A map[1:[2 3] 2:[3] 3:[1]]

B map[1:[2] 2:[3] 3:[]]

C map[1:[2] 2:[3] 3:[1]]

D map[1:[2] 2:[1] 3:[1]]

💡 Hint

Check which edges are added and if cycles appear in adjacency lists.

The code adds edges 1->2, 2->3, and 3->1, creating a cycle. The adjacency list shows these connections exactly.

🔧 Debug

advanced

Detecting cycles in a graph code output

What will be the output of this Go code that tries to detect a cycle in a directed graph?

DSA Go

package main
import "fmt"
var graph = map[int][]int{
  1: {2},
  2: {3},
  3: {4},
  4: {2},
}
var visited = map[int]bool{}
var recStack = map[int]bool{}
func dfs(node int) bool {
  if recStack[node] {
    return true
  }
  if visited[node] {
    return false
  }
  visited[node] = true
  recStack[node] = true
  for _, neighbor := range graph[node] {
    if dfs(neighbor) {
      return true
    }
  }
  recStack[node] = false
  return false
}
func main() {
  fmt.Println(dfs(1))
}

A false

B true

C runtime error

D compilation error

💡 Hint

Look for cycles in the graph edges and how recursion stack is used.

The graph has a cycle 2->3->4->2. The dfs detects this cycle and returns true.

📝 Syntax

advanced

Identify the syntax error in graph edge addition

Which option contains a syntax error when adding edges to a graph adjacency list in Go?

DSA Go

graph := make(map[int][]int)
graph[1] = append(graph[1], 2)

A graph[1] append(graph[1], 2)

B graph[1] = append(graph[1], 2)

C graph[1] = append(graph[1], 2, 3)

D graph[1] = append(graph[1], []int{2}...)

💡 Hint

Check for missing assignment or wrong syntax in append usage.

Option A misses the '=' sign before append, causing a syntax error.

🚀 Application

expert

Modeling complex relationships beyond trees

You want to model a transportation network where stations connect to multiple others in various directions, including loops. Which data structure best fits this?

A Graph with adjacency list representing connections

B Linked list of stations in order

C Binary tree with parent and child nodes

D Array of stations with no connections

💡 Hint

Think about multiple connections and loops in the network.

Graphs can represent multiple connections and cycles, unlike trees or lists.

Practice

1. Why do we need graphs when we already have trees in data structures?

easy

A. Because graphs can represent connections between nodes in any pattern, including cycles and multiple parents.

B. Because trees are faster to traverse than graphs.

C. Because trees can only store numbers, but graphs can store any data.

D. Because graphs use less memory than trees.

Solution

1. Step 1: Understand tree limitations

   Trees have a strict hierarchy where each node has only one parent and no cycles.

2. Step 2: Understand graph capabilities

   Graphs allow nodes to connect in any way, including cycles and multiple parents, which trees cannot model.

3. Final Answer:

   Because graphs can represent connections between nodes in any pattern, including cycles and multiple parents. -> Option A

4. Quick Check:

   Graphs model complex connections [OK]

Hint: Graphs allow cycles and multiple parents; trees do not [OK]

Common Mistakes:

• Thinking trees can have cycles
• Confusing data types stored with structure capabilities
• Assuming graphs always use less memory

2. Which of the following is the correct way to declare an adjacency list for a graph in Go?

easy

A. var graph [][]int = make(map[int][]int)

B. var graph []int = make([]int, 10)

C. var graph map[int]int = make(map[int]int)

D. var graph map[int][]int = make(map[int][]int)

Solution

1. Step 1: Understand adjacency list structure

   An adjacency list maps each node (int) to a list of connected nodes ([]int).

2. Step 2: Match Go syntax

   map[int][]int is the correct type, and make(map[int][]int) initializes it properly.

3. Final Answer:

   var graph map[int][]int = make(map[int][]int) -> Option D

4. Quick Check:

   Adjacency list = map[int][]int [OK]

Hint: Adjacency list is map from node to slice of nodes [OK]

Common Mistakes:

• Using slice instead of map for adjacency list
• Wrong map value type (int instead of []int)
• Incorrect initialization syntax

3. What will be the output of the following Go code snippet modeling a graph with cycles?

package main
import "fmt"
func main() {
    graph := map[int][]int{
        1: {2, 3},
        2: {3},
        3: {1},
    }
    visited := make(map[int]bool)
    dfs := func(node int) {}
    var dfsFunc func(int)
    dfsFunc = func(node int) {
        if visited[node] {
            return
        }
        visited[node] = true
        fmt.Print(node, " ")
        for _, neighbor := range graph[node] {
            dfsFunc(neighbor)
        }
    }
    dfsFunc(1)
}

medium

A. 1 2 3

B. 1 3 2

C. 1 2 3 1 3 2 (infinite loop)

D. Compilation error

Solution

1. Step 1: Trace DFS starting at node 1

   Visit 1, mark visited. Then visit neighbors 2 and 3 recursively, skipping visited nodes.

2. Step 2: Check visited to avoid cycles

   Node 3 points back to 1, but 1 is visited, so recursion stops, preventing infinite loop.

3. Final Answer:

   1 2 3 -> Option A

4. Quick Check:

   DFS with visited avoids cycles = 1 2 3 [OK]

Hint: Visited map prevents revisiting nodes in DFS [OK]

Common Mistakes:

• Ignoring visited check causing infinite recursion
• Confusing order of traversal
• Assuming compilation error due to recursion

4. Identify the bug in this Go code snippet that tries to build a graph adjacency list:

graph := make(map[int][]int)
graph[1] = append(graph[1], 2)
graph[2] = append(graph[2], 3)
graph[3] = append(graph[3], 1)

medium

A. The map is not initialized before use.

B. Appending to a nil slice in map causes runtime error.

C. No bug; code correctly builds the graph adjacency list.

D. Keys must be strings, not integers.

Solution

1. Step 1: Check map initialization

   map[int][]int is initialized with make, so it's ready for use.

2. Step 2: Understand append behavior on nil slices

   Appending to a nil slice returns a new slice; map entries get updated correctly.

3. Final Answer:

   No bug; code correctly builds the graph adjacency list. -> Option C

4. Quick Check:

   Appending to nil slice in map is safe [OK]

Hint: Appending to nil slice in map is safe in Go [OK]

Common Mistakes:

• Thinking map must be pre-filled with empty slices
• Assuming append on nil slice causes error
• Believing map keys must be strings

5. You want to model a social network where users can follow multiple users and cycles exist (e.g., A follows B, B follows C, C follows A). Why is a graph a better choice than a tree, and how would you represent this in Go?

hard

A. Because trees allow cycles; use a tree structure with parent pointers.

B. Because trees cannot represent cycles or multiple parents; use a map[int][]int adjacency list to represent followers.

C. Because trees are faster; use a slice of structs to represent users.

D. Because graphs use less memory; use a map[int]int to store followers.

Solution

1. Step 1: Understand why trees are insufficient

   Trees do not allow cycles or multiple parents, which are common in social networks.

2. Step 2: Choose graph representation in Go

   An adjacency list using map[int][]int maps each user to the list of users they follow, allowing cycles and multiple connections.

3. Final Answer:

   Because trees cannot represent cycles or multiple parents; use a map[int][]int adjacency list to represent followers. -> Option B

4. Quick Check:

   Graphs model cycles and multiple parents [OK]

Hint: Use graph adjacency list for cycles and multiple parents [OK]

Common Mistakes:

• Choosing tree despite cycles in data
• Using map[int]int which can't store multiple followers
• Assuming trees allow cycles