Why Graphs Exist and What Trees Cannot Model in DSA Typescript - Performance Analysis

Time Complexity: Why Graphs Exist and What Trees Cannot Model

O(n + e)

Understanding Time Complexity

We want to understand why graphs are needed beyond trees and how this affects the time to process connections.

How does the complexity of handling graphs compare to trees?

Scenario Under Consideration

Analyze the time complexity of traversing a graph compared to a tree.

function traverseGraph(adjList: Map, start: number): void {
  const visited = new Set();
  const stack = [start];
  while (stack.length > 0) {
    const node = stack.pop()!;
    if (!visited.has(node)) {
      visited.add(node);
      for (const neighbor of adjList.get(node) || []) {
        stack.push(neighbor);
      }
    }
  }
}
    

This code visits all nodes reachable from a start node in a graph using depth-first search.

Identify Repeating Operations

Look for loops and repeated visits.

• Primary operation: Visiting each node and exploring its neighbors.
• How many times: Each node and each edge is processed once during traversal.

How Execution Grows With Input

As the number of nodes and edges grows, the work grows with both.

Input Size (n nodes, e edges)	Approx. Operations
10 nodes, 15 edges	About 25 operations (nodes + edges)
100 nodes, 200 edges	About 300 operations
1000 nodes, 5000 edges	About 6000 operations

Pattern observation: Operations grow roughly with the sum of nodes and edges, not just nodes like in trees.

Final Time Complexity

Time Complexity: O(n + e)

This means the time to traverse depends on both the number of nodes and the number of edges in the graph.

Common Mistake

[X] Wrong: "Graphs are just like trees, so traversal time depends only on nodes."

[OK] Correct: Graphs can have many connections (edges) between nodes, so edges add to the work done.

Interview Connect

Understanding how graphs differ from trees and their traversal costs helps you explain data structure choices clearly and confidently.

Self-Check

What if the graph is very dense, with edges close to the maximum possible? How would that affect the time complexity?

Practice

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

easy

A. Because trees can only store numbers, not other data types.

B. Because trees are faster to traverse than graphs.

C. Because graphs are simpler and have no edges.

D. Because graphs can represent connections between nodes in any pattern, including cycles.

Solution

1. Step 1: Understand tree limitations

   Trees are hierarchical and cannot have cycles or multiple parents for a node.

2. Step 2: Understand graph capabilities

   Graphs allow any connections, including cycles and multiple edges between nodes.

3. Final Answer:

   Because graphs can represent connections between nodes in any pattern, including cycles. -> Option D

4. Quick Check:

   Graphs model cycles, trees cannot [OK]

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

Common Mistakes:

• Thinking trees can have cycles
• Confusing data types with structure
• Assuming graphs are simpler than trees

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

easy

A. const graph: number = [];

B. const graph: number[][] = [];

C. const graph: string = {};

D. const graph: boolean[] = {};

Solution

1. Step 1: Identify adjacency list type

   An adjacency list is an array of arrays, where each inner array holds connected node indices.

2. Step 2: Match TypeScript syntax

   TypeScript syntax for adjacency list is number[][] for array of number arrays.

3. Final Answer:

   const graph: number[][] = []; -> Option B

4. Quick Check:

   Adjacency list = number[][] [OK]

Hint: Adjacency list is array of arrays [OK]

Common Mistakes:

• Using single number type for adjacency list
• Using object {} instead of array []
• Wrong type annotations

3. Consider the following TypeScript code representing a graph with cycles:

const graph: number[][] = [[1], [2], [0]];
function hasCycle(node: number, visited: boolean[], stack: boolean[]): boolean {
  if (!visited[node]) {
    visited[node] = true;
    stack[node] = true;
    for (const neighbor of graph[node]) {
      if (!visited[neighbor] && hasCycle(neighbor, visited, stack)) {
        return true;
      } else if (stack[neighbor]) {
        return true;
      }
    }
  }
  stack[node] = false;
  return false;
}
const visited = [false, false, false];
const stack = [false, false, false];
console.log(hasCycle(0, visited, stack));

What is the output?

medium

A. Runtime error

B. false

C. true

D. undefined

Solution

1. Step 1: Understand graph structure

   Graph edges: 0->1, 1->2, 2->0 form a cycle.

2. Step 2: Trace hasCycle function

   DFS visits nodes 0,1,2 and detects back edge from 2 to 0 in recursion stack, returning true.

3. Final Answer:

   true -> Option C

4. Quick Check:

   Cycle detected = true [OK]

Hint: Cycle detection returns true if back edge found [OK]

Common Mistakes:

• Assuming no cycle in small graph
• Confusing visited and stack arrays
• Ignoring recursion stack usage

4. The following TypeScript code attempts to detect cycles in a graph but has a bug:

const graph: number[][] = [[1], [2], [0]];
function hasCycle(node: number, visited: boolean[], stack: boolean[]): boolean {
  if (visited[node]) {
    return false;
  }
  visited[node] = true;
  stack[node] = true;
  for (const neighbor of graph[node]) {
    if (!visited[neighbor] && hasCycle(neighbor, visited, stack)) {
      return true;
    } else if (stack[neighbor]) {
      return true;
    }
  }
  stack[node] = false;
  return false;
}
const visited = [false, false, false];
const stack = [false, false, false];
console.log(hasCycle(0, visited, stack));

What is the bug in this code?

medium

A. It returns false immediately if node is visited, missing cycles.

B. It never marks nodes as visited.

C. It uses wrong data types for visited and stack arrays.

D. It does not check neighbors of the node.

Solution

1. Step 1: Analyze early return on visited node

   Returning false immediately when node is visited skips cycle detection on back edges.

2. Step 2: Understand correct cycle detection logic

   Should only return false if node visited and not in recursion stack; else return true if in stack.

3. Final Answer:

   It returns false immediately if node is visited, missing cycles. -> Option A

4. Quick Check:

   Early return on visited node causes missed cycles [OK]

Hint: Do not return false immediately on visited node [OK]

Common Mistakes:

• Returning false too early
• Confusing visited and recursion stack
• Ignoring recursion stack check

5. You want to model a social network where users can follow each other in any pattern, including mutual follows and cycles. Which data structure best models this, and why can't a tree be used?

hard

A. Use a graph because it supports cycles and multiple connections; trees cannot model cycles or multiple parents.

B. Use a tree because it is simpler and supports cycles naturally.

C. Use a linked list because it models one-way connections well.

D. Use an array because it stores all users efficiently.

Solution

1. Step 1: Identify social network connection patterns

   Users can follow each other in any pattern, including cycles and mutual connections.

2. Step 2: Compare data structures

   Trees cannot represent cycles or multiple parents; graphs can represent any connection pattern.

3. Final Answer:

   Use a graph because it supports cycles and multiple connections; trees cannot model cycles or multiple parents. -> Option A

4. Quick Check:

   Graphs model social networks; trees cannot [OK]

Hint: Social networks need graphs for cycles and mutual links [OK]

Common Mistakes:

• Choosing tree for cyclic connections
• Confusing linked list with graph
• Ignoring cycles in social networks