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

Time Complexity: Why Graphs Exist and What Trees Cannot Model

O(n^2)

Understanding Time Complexity

We explore why graphs are needed beyond trees and how their time complexity differs.

We ask: How does the complexity grow when modeling connections that trees cannot represent?

Scenario Under Consideration

Analyze the time complexity of adding edges in a graph compared to a tree.

// Simple graph edge addition
void addEdge(int graph[][MAX], int u, int v) {
    graph[u][v] = 1;
    graph[v][u] = 1; // For undirected graph
}

// Simple tree edge addition
void addTreeEdge(int tree[][MAX], int parent, int child) {
    tree[parent][child] = 1;
}
    

This code adds edges to a graph and a tree represented by adjacency matrices.

Identify Repeating Operations

Look at how edges are added and traversed.

• Primary operation: Adding or checking edges between nodes.
• How many times: Up to n*(n-1)/2 times for graphs (dense connections), but only n-1 times for trees.

How Execution Grows With Input

As nodes increase, graphs can have many more edges than trees.

Input Size (n)	Approx. Edges in Graph
10	Up to 45 edges
100	Up to 4,950 edges
1000	Up to 499,500 edges

Pattern observation: Graph edges grow roughly with the square of nodes, while trees grow linearly.

Final Time Complexity

Time Complexity: O(n^2) for graphs, O(n) for trees

This means graph operations can take much longer as nodes increase because of many possible connections.

Common Mistake

[X] Wrong: "Graphs are just like trees but with more edges, so their complexity is the same."

[OK] Correct: Trees have a strict structure with fewer edges, so their operations are simpler and faster. Graphs can have many more connections, increasing complexity.

Interview Connect

Understanding why graphs exist and their complexity helps you explain data modeling choices clearly and shows you grasp real-world problems beyond simple hierarchies.

Self-Check

"What if the graph is sparse with very few edges? How would the time complexity change compared to a dense graph?"

Practice

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

easy

A. Because trees are faster to traverse than graphs.

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

C. Because trees can only store numbers, not connections.

D. Because graphs use less memory than trees.

Solution

1. Step 1: Understand tree limitations

   Trees are hierarchical structures with no cycles and only one path between nodes.

2. Step 2: Understand graph capabilities

   Graphs can represent any connections including cycles, multiple edges, and complex relationships.

3. Final Answer:

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

4. Quick Check:

   Graphs model complex connections, trees cannot [OK]

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

Common Mistakes:

• Thinking trees can have cycles
• Believing graphs use less memory always
• Confusing data storage with structure

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

easy

A. int graph(5,5);

B. int graph[5][5];

C. int graph[] = {5};

D. int* graph[5];

Solution

1. Step 1: Understand adjacency list representation

   An adjacency list uses an array of pointers to lists (or arrays) of neighbors.

2. Step 2: Match syntax to adjacency list

   "int* graph[5];" declares an array of 5 pointers to int, suitable for adjacency lists.

3. Final Answer:

   int* graph[5]; -> Option D

4. Quick Check:

   Adjacency list uses array of pointers [OK]

Hint: Adjacency list uses array of pointers in C [OK]

Common Mistakes:

• Using 2D array for adjacency list (it's adjacency matrix)
• Incorrect array declaration syntax
• Confusing arrays with function calls

3. Consider the following C code snippet representing a graph adjacency matrix. What will be the output?

int graph[3][3] = {
  {0, 1, 0},
  {1, 0, 1},
  {0, 1, 0}
};

for(int i = 0; i < 3; i++) {
  for(int j = 0; j < 3; j++) {
    if(graph[i][j] == 1) {
      printf("%d -> %d\n", i, j);
    }
  }
}

medium

A. No output

B. 0 -> 1
1 -> 2
2 -> 0

C. 0 -> 1
1 -> 0
1 -> 2
2 -> 1

D. 0 -> 0
1 -> 1
2 -> 2

Solution

1. Step 1: Analyze adjacency matrix values

   Positions with 1 indicate edges: (0,1), (1,0), (1,2), (2,1).

2. Step 2: Trace nested loops printing edges

   Loops print edges where graph[i][j] == 1, so output lines are 0->1, 1->0, 1->2, 2->1.

3. Final Answer:

   0 -> 1 1 -> 0 1 -> 2 2 -> 1 -> Option C

4. Quick Check:

   Edges printed match adjacency matrix 1s [OK]

Hint: Print edges where adjacency matrix value is 1 [OK]

Common Mistakes:

• Ignoring symmetric edges
• Printing zeros as edges
• Confusing indices i and j

4. The following code attempts to create a graph with cycles using a tree structure. What is the main issue?

struct Node {
  int val;
  struct Node* left;
  struct Node* right;
};

// Trying to link nodes to form a cycle
node1->left = node2;
node2->left = node3;
node3->left = node1; // cycle created here

medium

A. Trees cannot have cycles, so this creates an invalid structure.

B. The pointers are not initialized properly causing segmentation fault.

C. The code will compile but not run because of missing return statements.

D. There is no issue; trees can have cycles.

Solution

1. Step 1: Understand tree structure rules

   Trees must not have cycles; each node has exactly one parent except root.

2. Step 2: Identify cycle creation in code

   Linking node3 back to node1 creates a cycle, violating tree properties.

3. Final Answer:

   Trees cannot have cycles, so this creates an invalid structure. -> Option A

4. Quick Check:

   Cycle in tree structure is invalid [OK]

Hint: Trees cannot contain cycles; cycles break tree rules [OK]

Common Mistakes:

• Thinking cycles are allowed in trees
• Confusing compile errors with logical errors
• Ignoring pointer initialization

5. You want to model a social network where users can be friends with multiple users, including mutual friendships and groups. Which data structure best models this, and why can't a tree be used here?

hard

A. Graph, because it supports cycles and multiple connections between nodes.

B. Tree, because it is simpler and faster for all connections.

C. Array, because it stores all users in order.

D. Linked list, because it can represent multiple friendships easily.

Solution

1. Step 1: Identify social network connection needs

   Users can have multiple friends, mutual connections, and cycles (friend loops).

2. Step 2: Match data structure capabilities

   Graphs support cycles and multiple edges; trees cannot have cycles or multiple parents.

3. Final Answer:

   Graph, because it supports cycles and multiple connections between nodes. -> Option A

4. Quick Check:

   Social networks need graphs, not trees [OK]

Hint: Use graphs for mutual and multiple connections [OK]

Common Mistakes:

• Choosing tree for cyclic relationships
• Confusing arrays or lists with graph structures
• Ignoring mutual friendship cycles