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

Graph vs Tree Key Structural Difference

📖 Scenario: Imagine you are organizing a family reunion and a city map. The family reunion is like a tree structure where each person has one parent, but the city map is like a graph where places connect in many ways.

🎯 Goal: You will create simple data structures to represent a tree and a graph, then check the key difference: whether nodes have multiple parents or cycles.

📋 What You'll Learn

Create a tree structure using an adjacency list with no cycles

Create a graph structure using an adjacency list that can have cycles

Add a variable to track if the graph has cycles

Write a simple function to detect if the graph has cycles

Print the adjacency lists and cycle detection result

💡 Why This Matters

🌍 Real World

Trees are used in family trees, file systems, and organizational charts. Graphs are used in maps, social networks, and web links.

💼 Career

Understanding the difference between trees and graphs helps in software development, data analysis, and solving problems involving networks and hierarchies.

1

Create a tree adjacency list

Create a variable called tree as an object representing a tree adjacency list with these exact entries: 1: [2, 3], 2: [4], 3: [], 4: []

DSA Typescript

// Your code here

Hint

Use an object where keys are node numbers and values are arrays of child nodes.

2

Create a graph adjacency list

Create a variable called graph as an object representing a graph adjacency list with these exact entries: 1: [2, 3], 2: [3], 3: [1]

DSA Typescript

const tree: { [key: number]: number[] } = {
  1: [2, 3],
  2: [4],
  3: [],
  4: []
};
// Your code here

Hint

Graph can have cycles, so node 3 connects back to node 1.

3

Add cycle detection variable and function

Create a variable called hasCycle and set it to false. Then write a function called detectCycle that takes graph and returns true if a cycle exists, otherwise false. For simplicity, return true if node 3 connects back to node 1, else false.

DSA Typescript

const tree: { [key: number]: number[] } = {
  1: [2, 3],
  2: [4],
  3: [],
  4: []
};

const graph: { [key: number]: number[] } = {
  1: [2, 3],
  2: [3],
  3: [1]
};

// Your code here

Hint

Check if node 3's adjacency list includes node 1 to detect a cycle.

4

Print adjacency lists and cycle detection result

Write console.log statements to print the tree adjacency list, the graph adjacency list, and the hasCycle variable.

DSA Typescript

const tree: { [key: number]: number[] } = {
  1: [2, 3],
  2: [4],
  3: [],
  4: []
};

const graph: { [key: number]: number[] } = {
  1: [2, 3],
  2: [3],
  3: [1]
};

let hasCycle = false;

function detectCycle(graph: { [key: number]: number[] }): boolean {
  if (graph[3] && graph[3].includes(1)) {
    return true;
  }
  return false;
}

hasCycle = detectCycle(graph);

// Your code here

Hint

Use console.log to print each variable with a label.

Practice

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

easy

A. A graph is always directed, but a tree is always undirected.

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 tree has no cycles, but a graph can have cycles.

Solution

1. Step 1: Understand the cycle property in trees and graphs

   A tree is a special type of graph that does not contain any cycles, meaning no path loops back to the same node.

2. Step 2: Compare cycle allowance in graphs

   Graphs can have cycles, meaning they can contain loops where you can start at a node and return to it by following edges.

3. Final Answer:

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

4. Quick Check:

   Tree no cycles, graph can have cycles = D [OK]

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

Common Mistakes:

• Thinking graphs must have a root node
• Believing trees can have cycles
• Confusing edge multiplicity rules

2. Which of the following TypeScript declarations correctly represents a tree node structure?

easy

A. interface Node { value: number; neighbors: Node[]; }

B. interface Node { value: number; parent: Node[]; }

C. interface Node { value: number; children: Node[]; }

D. interface Node { value: number; edges: number[]; }

Solution

1. Step 1: Identify tree node properties

   A tree node typically has a value and a list of children nodes, representing a hierarchical structure.

2. Step 2: Match the correct interface

   interface Node { value: number; children: Node[]; } uses children: Node[], which correctly models tree children. Other options use neighbors or parent arrays, which are more graph-like or incorrect.

3. Final Answer:

   interface Node { value: number; children: Node[]; } -> Option C

4. Quick Check:

   Tree nodes have children array = B [OK]

Hint: Trees use children arrays, graphs use neighbors [OK]

Common Mistakes:

• Using neighbors instead of children for trees
• Confusing parent arrays with children
• Using edges as numbers instead of nodes

3. Consider this TypeScript code snippet representing a graph and a tree. What will be the output of the console.log statements?

medium

A. "Graph has cycles: true, Tree has cycles: false"

B. "Graph has cycles: false, Tree has cycles: true"

C. "Graph has cycles: false, Tree has cycles: false"

D. "Graph has cycles: true, Tree has cycles: true"

Solution

1. Step 1: Analyze the graph structure for cycles

   The graph has edges forming a cycle (e.g., node1 -> node2 -> node3 -> node1), so it contains cycles.

2. Step 2: Analyze the tree structure for cycles

   The tree is built with parent-child links and no back edges, so it has no cycles.

3. Final Answer:

   "Graph has cycles: true, Tree has cycles: false" -> Option A

4. Quick Check:

   Graph cycles true, tree cycles false = A [OK]

Hint: Graphs can cycle, trees cannot [OK]

Common Mistakes:

• Assuming trees can have cycles
• Ignoring cycle detection in graphs
• Confusing output strings

4. The following TypeScript code attempts to build a tree but has a structural error. What is the main issue?

medium

A. The tree nodes have multiple parents, violating tree structure.

B. The tree nodes use neighbors instead of children arrays.

C. The tree nodes have cycles due to incorrect parent references.

D. The tree root node is missing a value property.

Solution

1. Step 1: Check parent references in the tree nodes

   Each tree node should have only one parent. Multiple parents mean the structure is not a tree.

2. Step 2: Identify multiple parents in the code

   The code assigns two different parents to a single node, creating multiple parent links and breaking the tree property.

3. Final Answer:

   The tree nodes have multiple parents, violating tree structure. -> Option A

4. Quick Check:

   Multiple parents break tree rules = C [OK]

Hint: Trees have one parent per node only [OK]

Common Mistakes:

• Confusing neighbors with children
• Ignoring multiple parent assignments
• Missing value property is not main error

5. You need to convert a graph into a tree by removing edges. Which key structural property must you ensure after removal?

hard

A. The resulting structure must have at least one cycle.

B. The resulting structure must be connected and have no cycles.

C. The resulting structure must have multiple parents for some nodes.

D. The resulting structure must allow multiple edges between same nodes.

Solution

1. Step 1: Understand tree properties

   A tree is a connected structure with no cycles and exactly one path between any two nodes.

2. Step 2: Apply properties to graph conversion

   To convert a graph to a tree, remove edges to eliminate cycles but keep the graph connected.

3. Final Answer:

   The resulting structure must be connected and have no cycles. -> Option B

4. Quick Check:

   Tree = connected + no cycles = A [OK]

Hint: Tree = connected graph without cycles [OK]

Common Mistakes:

• Allowing cycles in the tree
• Permitting multiple parents
• Keeping multiple edges between nodes