Why Graphs Exist and What Trees Cannot Model in DSA C - Quick Recap

Recall & Review

beginner

What is a key limitation of trees that graphs overcome?

Trees cannot model relationships where nodes have multiple parents or cycles. Graphs can represent these complex connections.

beginner

Why do graphs exist in data structures?

Graphs exist to represent complex relationships like networks, where connections can be many-to-many and cycles can occur, which trees cannot model.

intermediate

Explain with an example a situation where a tree structure fails but a graph works.

In a social network, a person can have many friends (multiple parents), and friendships can form cycles. Trees cannot represent this, but graphs can.

beginner

What does it mean when we say trees are 'acyclic' and graphs can have 'cycles'?

Trees have no loops; you cannot start at one node and return to it by following edges. Graphs can have cycles, meaning loops are allowed.

intermediate

Can a tree be considered a special type of graph? Why or why not?

Yes, a tree is a special kind of graph that is connected and has no cycles. But not all graphs are trees because graphs can have cycles and multiple connections.

Which structure can represent multiple parents for a single node?

A Linked List

B Tree

C Graph

D Array

Graphs allow nodes to have multiple parents or connections; trees do not.

What is a key feature that trees do NOT have but graphs can have?

A Nodes

B Cycles

C Edges

D Root node

Trees are acyclic, meaning they cannot have cycles; graphs can have cycles.

Why can't trees model social networks well?

A Because social networks have cycles and multiple connections

B Because trees are too big

C Because trees have no nodes

D Because trees are unordered

Social networks have complex connections and cycles, which trees cannot represent.

Which of these is true about trees?

A They have exactly one path between any two nodes

B They can have cycles

C Nodes can have multiple parents

D They are always disconnected

Trees have exactly one path between any two nodes because they are connected and acyclic.

Graphs are used when:

A Data is linear

B Data is strictly hierarchical

C Only one parent per node is allowed

D Relationships are complex with cycles and multiple connections

Graphs model complex relationships including cycles and multiple connections.

Explain why trees cannot model certain real-world relationships and how graphs solve this problem.

Think about social networks or road maps.

Describe the main differences between trees and graphs in terms of structure and use cases.

Consider hierarchy vs network.

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