Why Graphs Exist and What Trees Cannot Model in DSA Java - See It Work

Why Graphs Exist and What Trees Cannot Model

📖 Scenario: Imagine you are organizing a social network where people can be friends with many others, not just in a strict family tree. Trees are great for family relations but cannot show friendships or connections that loop back. Graphs help us model these complex connections.

🎯 Goal: You will create a simple graph using a dictionary-like structure to represent friendships between people. Then, you will add a configuration to select a person and find all their friends. Finally, you will print the list of friends to see how graphs model relationships that trees cannot.

📋 What You'll Learn

Create a graph using a dictionary where keys are person names and values are lists of friends

Add a variable to select a specific person to find friends for

Get the list of friends for the selected person

Print the list of friends for the selected person

💡 Why This Matters

🌍 Real World

Social networks, recommendation systems, and many real-world connections are best modeled using graphs because they allow multiple connections and loops.

💼 Career

Understanding graphs is essential for software engineers working on social media, networking, and data science roles where complex relationships must be represented.

1

Create the graph data structure

Create a dictionary called friendGraph with these exact entries: "Alice" connected to ["Bob", "Charlie"], "Bob" connected to ["Alice", "David"], and "Charlie" connected to ["Alice"].

DSA Java

// Your code here

Hint

Use a HashMap with String keys and List<String> values. Use Arrays.asList to create the lists.

2

Select a person to find friends

Add a variable called selectedPerson and set it to "Bob".

DSA Java

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Map> friendGraph = new HashMap();
        friendGraph.put("Alice", Arrays.asList("Bob", "Charlie"));
        friendGraph.put("Bob", Arrays.asList("Alice", "David"));
        friendGraph.put("Charlie", Arrays.asList("Alice"));

        // Your code here
    }
}

Hint

Declare a String variable named selectedPerson and assign it the value "Bob".

3

Get the friends of the selected person

Create a variable called friends and set it to the list of friends for selectedPerson from friendGraph.

DSA Java

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Map> friendGraph = new HashMap();
        friendGraph.put("Alice", Arrays.asList("Bob", "Charlie"));
        friendGraph.put("Bob", Arrays.asList("Alice", "David"));
        friendGraph.put("Charlie", Arrays.asList("Alice"));

        String selectedPerson = "Bob";

        // Your code here
    }
}

Hint

Use the get method on friendGraph with selectedPerson to get the list of friends.

4

Print the friends of the selected person

Print the list friends using System.out.println(friends).

DSA Java

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Map> friendGraph = new HashMap();
        friendGraph.put("Alice", Arrays.asList("Bob", "Charlie"));
        friendGraph.put("Bob", Arrays.asList("Alice", "David"));
        friendGraph.put("Charlie", Arrays.asList("Alice"));

        String selectedPerson = "Bob";

        List friends = friendGraph.get(selectedPerson);

        // Your code here
    }
}

Hint

Use System.out.println(friends) to print the list of friends.

Practice

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

easy

A. Because graphs use less memory than trees.

B. Because graphs can represent connections between nodes in any pattern, including cycles and multiple parents, which trees cannot.

C. Because trees cannot store any data in nodes.

D. Because trees are slower to traverse than graphs.

Solution

1. Step 1: Understand tree structure limitations

   Trees have a strict hierarchy where each node has exactly one parent except the root, and no cycles are allowed.

2. Step 2: Understand graph flexibility

   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, which trees cannot. -> Option B

4. Quick Check:

   Graphs model complex connections = D [OK]

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

Common Mistakes:

• Thinking trees can have cycles
• Confusing memory use between trees and graphs
• Believing trees cannot store data

2. Which of the following is the correct way to declare a graph adjacency list in Java using a HashMap?

easy

A. HashMap graph = new HashMap<>();

B. HashMap graph = new HashMap<>();

C. HashMap graph = new HashMap<>();

D. HashMap graph = new HashMap<>();

Solution

1. Step 1: Identify correct key and value types for adjacency list

   Keys are node identifiers (Integer), values are lists of connected nodes (List<Integer>).

2. Step 2: Check syntax correctness

   HashMap graph = new HashMap<>(); uses HashMap which correctly represents adjacency list.

3. Final Answer:

   HashMap graph = new HashMap<>(); -> Option D

4. Quick Check:

   Adjacency list uses map of node to list [OK]

Hint: Adjacency list maps node to list of neighbors [OK]

Common Mistakes:

• Using primitive int as generic type
• Mapping node to single Integer instead of list
• Using wrong generic types like String when nodes are integers

3. Consider the following Java code snippet that builds a graph and prints its adjacency list:

import java.util.*;
public class GraphExample {
    public static void main(String[] args) {
        HashMap graph = new HashMap<>();
        graph.put(1, Arrays.asList(2, 3));
        graph.put(2, Arrays.asList(1, 4));
        graph.put(3, Arrays.asList(1));
        graph.put(4, Arrays.asList(2));
        for (int node : graph.keySet()) {
            System.out.print(node + " -> ");
            for (int neighbor : graph.get(node)) {
                System.out.print(neighbor + " ");
            }
            System.out.println();
        }
    }
}

What is the output of this program?

medium

A. 1 -> 2 3
2 -> 1 4
3 -> 1
4 -> 2

B. 1 -> 3 2
2 -> 4 1
3 -> 1
4 -> 2

C. 1 -> 2 3
2 -> 4 1
3 -> 1
4 -> 2

D. 1 -> 2 3
2 -> 1 4
3 -> 4
4 -> 2

Solution

1. Step 1: Analyze graph construction

   Node 1 connects to 2 and 3; 2 connects to 1 and 4; 3 connects to 1; 4 connects to 2.

2. Step 2: Trace print output

   For each node, print node followed by neighbors in order stored in list.

3. Final Answer:

   1 -> 2 3 2 -> 1 4 3 -> 1 4 -> 2 -> Option A

4. Quick Check:

   Printed adjacency matches stored lists = A [OK]

Hint: Print neighbors in stored order for each node [OK]

Common Mistakes:

• Mixing neighbor order
• Printing wrong neighbors for nodes
• Confusing node keys with neighbor values

4. The following Java code attempts to add an edge between two nodes in an undirected graph represented by an adjacency list. Find the error:

void addEdge(HashMap graph, int u, int v) {
    graph.get(u).add(v);
    graph.get(v).add(u);
}

medium

A. The code uses List<Integer> instead of Set<Integer> for neighbors.

B. The code should remove edges instead of adding them.

C. The code does not check if nodes u and v exist in the graph before adding edges.

D. The code incorrectly adds edges only in one direction.

Solution

1. Step 1: Check for node existence before adding edges

   graph.get(u) or graph.get(v) may return null if nodes are not present, causing NullPointerException.

2. Step 2: Identify missing null checks or initialization

   Code should verify nodes exist or initialize adjacency lists before adding neighbors.

3. Final Answer:

   The code does not check if nodes u and v exist in the graph before adding edges. -> Option C

4. Quick Check:

   Missing node existence check causes error = B [OK]

Hint: Always check nodes exist before adding edges [OK]

Common Mistakes:

• Assuming nodes always exist in graph
• Confusing undirected with directed edges
• Ignoring possibility of NullPointerException

5. You want to model a social network where users can follow each other in any pattern, including mutual follows and cycles. Why is a graph a better choice than a tree for this model, and how would you represent it in Java?

hard

A. Because trees cannot represent cycles or mutual connections; use a HashMap to store user IDs and their followers.

B. Because trees are faster to search; use a TreeMap to store user IDs.

C. Because trees allow multiple parents; use a HashSet<Integer> to store users.

D. Because trees prevent cycles; use an array to store user connections.

Solution

1. Step 1: Understand social network connections

   Users can follow each other in any pattern, including cycles and mutual follows, which trees cannot model.

2. Step 2: Choose graph representation in Java

   Use HashMap to map each user ID to a list of users they follow.

3. Final Answer:

   Because trees cannot represent cycles or mutual connections; use a HashMap to store user IDs and their followers. -> Option A

4. Quick Check:

   Graphs model cycles; HashMap with lists stores connections [OK]

Hint: Use graph with adjacency list for mutual and cyclic connections [OK]

Common Mistakes:

• Choosing tree which disallows cycles
• Using TreeMap or array which limits connection types
• Confusing followers with parents in tree