Why Graphs Exist and What Trees Cannot Model in DSA Python - 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 we need graphs when trees exist?

Graphs exist to model real-world problems where connections are not strictly hierarchical, such as social networks or road maps, which trees cannot represent.

intermediate

What kind of relationships can graphs represent that trees cannot?

Graphs can represent many-to-many relationships, cycles, and complex networks where nodes can connect in any pattern, unlike trees which are strictly hierarchical and acyclic.

intermediate

Explain why a family tree cannot model marriages between cousins but a graph can.

A family tree is hierarchical and does not allow cycles or multiple parents for a node. Marriages between cousins create cycles and multiple parent relationships, which graphs can model but trees cannot.

beginner

What is a cycle in graph theory and why can't trees have them?

A cycle is a path where you can start at a node and return to it by following edges without retracing steps. Trees cannot have cycles because they are acyclic by definition.

Which data structure can represent cycles?

A Stack

B Graph

C Array

D Tree

Graphs can represent cycles; trees cannot because they are acyclic.

What kind of relationship can a tree NOT model?

A Many-to-many

B Many-to-one

C One-to-many

D None of the above

Trees cannot model many-to-many relationships because each node has only one parent.

Why are graphs used to model social networks?

A Because social networks are linear

B Because social networks have hierarchical data

C Because social networks have cycles and complex connections

D Because social networks have no connections

Social networks have cycles and complex connections that graphs can model.

Which of these is NOT true about trees?

A They can have multiple parents per node

B They are acyclic

C They have a hierarchical structure

D They cannot represent cycles

Trees cannot have multiple parents per node; each node has exactly one parent except the root.

What does a cycle in a graph allow that a tree forbids?

A Only one child per node

B Multiple roots

C No edges

D Returning to the same node by following edges

A cycle allows returning to the same node by following edges, which trees forbid.

Explain why trees cannot model many real-world networks and how graphs solve this problem.

Think about family trees vs social networks.

Describe what a cycle is in graph theory and why it is important for modeling complex relationships.

Imagine a road map where you can drive in a loop.

Practice

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

easy

A. Because graphs use less memory than trees.

B. Because trees are faster to traverse than graphs.

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

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

Solution

1. Step 1: Understand tree limitations

   Trees have a strict hierarchy: 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.

3. Final Answer:

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

4. Quick Check:

   Graphs model complex connections unlike trees [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 type
• Assuming graphs always use less memory

2. Which of the following is the correct way to represent an undirected graph using adjacency lists in Python?

easy

A. graph = [[1, 2], [2, 3], [3, 1]]

B. graph = {1: (2, 3), 2: (1), 3: (1)}

C. graph = {1: 2, 2: 3, 3: 1}

D. graph = {1: [2, 3], 2: [1], 3: [1]}

Solution

1. Step 1: Understand adjacency list format

   Adjacency lists use a dictionary with keys as nodes and values as lists of connected nodes.

2. Step 2: Check each option

   graph = {1: [2, 3], 2: [1], 3: [1]} uses dictionary with lists correctly; others use tuples, lists of pairs, or single values incorrectly.

3. Final Answer:

   graph = {1: [2, 3], 2: [1], 3: [1]} -> Option D

4. Quick Check:

   Adjacency list = dict with lists [OK]

Hint: Adjacency lists use dict keys with list values [OK]

Common Mistakes:

• Using tuples instead of lists for adjacency
• Using list of pairs instead of dict
• Assigning single node instead of list

3. What will be the output of the following Python code that models a graph?

graph = {1: [2, 3], 2: [1, 3], 3: [1, 2]}
print(len(graph[2]))

medium

A. 2

B. 1

C. 3

D. Error

Solution

1. Step 1: Analyze graph dictionary

   Node 2 connects to nodes 1 and 3, so graph[2] = [1, 3].

2. Step 2: Calculate length of adjacency list

   Length of graph[2] is 2 because it has two connected nodes.

3. Final Answer:

   2 -> Option A

4. Quick Check:

   len([1, 3]) = 2 [OK]

Hint: Count connected nodes in adjacency list [OK]

Common Mistakes:

• Counting total nodes instead of neighbors
• Confusing keys with values
• Expecting error due to syntax

4. The following code tries to add an edge between nodes in an undirected graph but has a bug. What is the bug?

graph = {1: [2], 2: [1]}
def add_edge(u, v):
    graph[u].append(v)
    graph[v].append(u)

add_edge(2, 3)
print(graph)

medium

A. Node 3 is not initialized in the graph before adding edges.

B. The append method is used incorrectly.

C. The graph dictionary should use sets instead of lists.

D. The function add_edge should return the graph.

Solution

1. Step 1: Check graph initialization

   Node 3 does not exist in graph keys before add_edge is called.

2. Step 2: Understand append behavior

   Appending to graph[v] fails because graph[3] key is missing, causing KeyError.

3. Final Answer:

   Node 3 is not initialized in the graph before adding edges. -> Option A

4. Quick Check:

   Missing key causes error [OK]

Hint: Initialize nodes before adding edges [OK]

Common Mistakes:

• Assuming append works without key
• Thinking return needed in add_edge
• Confusing list vs set usage

5. Given a tree structure, which of the following scenarios can only be correctly modeled by converting it into a graph?

hard

A. Representing a family tree where each child has exactly one parent.

B. Modeling a social network where users can follow each other mutually or one-way.

C. Storing a file directory where each folder has a single parent folder.

D. Organizing a company's hierarchy with clear reporting lines.

Solution

1. Step 1: Analyze tree modeling scenarios

   Family trees, file directories, and company hierarchies have strict parent-child relations, fitting trees.

2. Step 2: Analyze graph necessity

   Social networks have complex connections, including cycles and mutual or one-way links, needing graphs.

3. Final Answer:

   Modeling a social network where users can follow each other mutually or one-way. -> Option B

4. Quick Check:

   Complex connections need graphs [OK]

Hint: Use graphs for mutual or cyclic connections [OK]

Common Mistakes:

• Thinking family trees need graphs
• Confusing hierarchy with network
• Assuming all parent-child fit graphs only