Graph vs Tree Key Structural Difference in DSA Javascript - Build Both Approaches

Graph vs Tree Key Structural Difference

📖 Scenario: Imagine you are organizing a family reunion and a group of friends. You want to represent family relationships and friendships visually using simple data structures.

🎯 Goal: You will create two data structures: one representing a family tree and another representing a friendship graph. You will then identify the key structural difference by printing their connections.

📋 What You'll Learn

Create a tree structure representing family members with parent-child relationships.

Create a graph structure representing friendships where connections can be mutual and cyclic.

Use adjacency lists to represent both structures.

Print the connections to observe the structural difference.

💡 Why This Matters

🌍 Real World

Trees are used to represent hierarchical data like family trees or file systems. Graphs are used to represent networks like social connections or road maps.

💼 Career

Understanding the difference between trees and graphs is fundamental for software engineers working with data structures, databases, and network algorithms.

1

Create a family tree adjacency list

Create a variable called familyTree as an object representing a tree with these exact parent-child connections: 'Grandparent' has children 'Parent1' and 'Parent2', 'Parent1' has child 'Child1', and 'Parent2' has child 'Child2'. Use arrays for children lists.

DSA Javascript

# Your code here

Hint

Use an object with keys as family members and values as arrays of their children.

2

Create a friendship graph adjacency list

Create a variable called friendGraph as an object representing a graph with these exact friendships: 'Alice' is friends with 'Bob' and 'Charlie', 'Bob' is friends with 'Alice' and 'David', 'Charlie' is friends with 'Alice', and 'David' is friends with 'Bob'. Use arrays for friends lists.

DSA Javascript

const familyTree = {
  'Grandparent': ['Parent1', 'Parent2'],
  'Parent1': ['Child1'],
  'Parent2': ['Child2'],
  'Child1': [],
  'Child2': []
};

// Your code here

Hint

Use an object with keys as friends and values as arrays of their friends.

3

Write a function to print connections

Write a function called printConnections that takes an object called graph and prints each key followed by an arrow and its connected nodes separated by commas. Use a for...in loop to iterate over graph.

DSA Javascript

const familyTree = {
  'Grandparent': ['Parent1', 'Parent2'],
  'Parent1': ['Child1'],
  'Parent2': ['Child2'],
  'Child1': [],
  'Child2': []
};

const friendGraph = {
  'Alice': ['Bob', 'Charlie'],
  'Bob': ['Alice', 'David'],
  'Charlie': ['Alice'],
  'David': ['Bob']
};

// Your code here

Hint

Use for...in to loop over keys and join to combine connected nodes.

4

Print family tree and friendship graph connections

Call printConnections with familyTree and then with friendGraph to print their connections.

DSA Javascript

const familyTree = {
  'Grandparent': ['Parent1', 'Parent2'],
  'Parent1': ['Child1'],
  'Parent2': ['Child2'],
  'Child1': [],
  'Child2': []
};

const friendGraph = {
  'Alice': ['Bob', 'Charlie'],
  'Bob': ['Alice', 'David'],
  'Charlie': ['Alice'],
  'David': ['Bob']
};

function printConnections(graph) {
  for (const node in graph) {
    console.log(node + ' -> ' + graph[node].join(', '));
  }
}

// Your code here

Hint

Call printConnections(familyTree) and printConnections(friendGraph).

Practice

1. Which of the following is a key structural difference between a graph and a tree?

easy

A. A tree has no cycles, but a graph can have cycles.

B. A graph always has a root node, but a tree does not.

C. A tree can have multiple edges between the same nodes, but a graph cannot.

D. A graph must be connected, but a tree can be disconnected.

Solution

1. Step 1: Understand tree structure

   A tree is a special type of graph that is connected and has no cycles.

2. Step 2: Compare with graph properties

   Graphs can have cycles and may or may not be connected.

3. Final Answer:

   A tree has no cycles, but a graph can have cycles. -> Option A

4. Quick Check:

   No cycles in tree = key difference [OK]

Hint: Trees never loop back; graphs can have loops [OK]

Common Mistakes:

• Thinking graphs always have a root node
• Believing trees can have cycles
• Confusing connectivity rules between graphs and trees

2. Which syntax correctly represents a tree structure in JavaScript using adjacency lists?

easy

A. const tree = [ [1, 2], [2, 3], [3, 4] ];

B. const tree = { 1: 2, 2: 3, 3: 4 };

C. const tree = { 1: [2, 3], 2: [4], 3: [], 4: [] };

D. const tree = [1, 2, 3, 4];

Solution

1. Step 1: Identify adjacency list format

   An adjacency list uses an object with keys as nodes and values as arrays of connected nodes.

2. Step 2: Check each option

   const tree = { 1: [2, 3], 2: [4], 3: [], 4: [] }; matches adjacency list format for a tree; others do not represent adjacency lists properly.

3. Final Answer:

   const tree = { 1: [2, 3], 2: [4], 3: [], 4: [] }; -> Option C

4. Quick Check:

   Adjacency list uses object with arrays [OK]

Hint: Adjacency list = object keys with array values [OK]

Common Mistakes:

• Using arrays of pairs instead of adjacency lists
• Assigning single values instead of arrays for neighbors
• Confusing array of nodes with adjacency list

3. What will be the output of the following code snippet representing a graph with a cycle?

const graph = { 1: [2], 2: [3], 3: [1] };
function hasCycle(node, visited, stack) {
  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;
}
console.log(hasCycle(1, {}, {}));

medium

A. false

B. true

C. undefined

D. TypeError

Solution

1. Step 1: Understand the graph structure

   The graph has edges 1->2, 2->3, and 3->1, forming a cycle.

2. Step 2: Trace the hasCycle function

   Starting at node 1, the function detects the cycle when it revisits node 1 in the recursion stack.

3. Final Answer:

   true -> Option B

4. Quick Check:

   Cycle detected = true [OK]

Hint: Cycle detection returns true if node revisited in recursion [OK]

Common Mistakes:

• Assuming no cycle because of simple code
• Confusing visited and recursion stack usage
• Expecting false without tracing recursion

4. Find the error in the following code that tries to check if a tree has cycles:

const tree = { 1: [2], 2: [3], 3: [] };
function hasCycle(node, visited) {
  if (visited[node]) return true;
  visited[node] = true;
  for (const neighbor of tree[node]) {
    if (hasCycle(neighbor, visited)) return true;
  }
  return false;
}
console.log(hasCycle(1, {}));

medium

A. The function does not track recursion stack, so false positives occur.

B. The visited object is not initialized properly.

C. The tree object keys should be numbers, not strings.

D. The function should return false immediately after visiting a node.

Solution

1. Step 1: Analyze cycle detection logic

   The function uses only visited to detect cycles but misses recursion stack tracking.

2. Step 2: Explain why this causes errors

   Without recursion stack, revisiting a node from a different branch may cause false cycle detection.

3. Final Answer:

   The function does not track recursion stack, so false positives occur. -> Option A

4. Quick Check:

   Missing recursion stack causes wrong cycle detection [OK]

Hint: Track recursion stack to avoid false cycle detection [OK]

Common Mistakes:

• Ignoring recursion stack importance
• Assuming visited alone detects cycles correctly
• Confusing object key types

5. Given a graph represented as adjacency lists, how can you verify if it is a tree? Choose the best approach.

hard

A. Check if the graph has cycles and is disconnected.

B. Check if the graph has no cycles regardless of connectivity.

C. Check if the graph has a root node and all nodes have at most two children.

D. Check if the graph is connected and has exactly n-1 edges for n nodes.

Solution

1. Step 1: Recall tree properties

   A tree with n nodes must be connected and have exactly n-1 edges, with no cycles.

2. Step 2: Analyze options

   Check if the graph is connected and has exactly n-1 edges for n nodes. correctly combines connectivity and edge count to verify a tree. Others miss key conditions.

3. Final Answer:

   Check if the graph is connected and has exactly n-1 edges for n nodes. -> Option D

4. Quick Check:

   Connectivity + edges = tree check [OK]

Hint: Tree = connected + edges = nodes minus one [OK]

Common Mistakes:

• Ignoring connectivity requirement
• Only checking for cycles without edges count
• Assuming root or children count defines tree