Graph vs Tree Key Structural Difference in DSA Typescript - Interactive Comparison Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to check if a graph has no cycles, which is a key property of a tree.

DSA Typescript

function isTree(graph: Map<number, number[]>): boolean {
  // A tree has no cycles
  return !hasCycle(graph, [1]);
}

Drag options to blanks, or click blank then click option'

A1

B0

C-1

Dnull

Attempts:

3 left

💡 Hint

Common Mistakes

Starting cycle check from a non-existent node like 0 or -1.

We start cycle detection from node 1 (assuming nodes start at 1). Trees have no cycles.

2fill in blank

medium

Complete the code to count edges in a tree given nodes count n.

DSA Typescript

function countEdgesInTree(n: number): number {
  // A tree with n nodes has [1] edges
  return n - 1;
}

Drag options to blanks, or click blank then click option'

An

Bn + 1

Cn - 1

Dn * 2

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing edges count with nodes count.

A tree with n nodes always has n-1 edges.

3fill in blank

hard

Fix the error in the function that checks if a graph is connected (a tree must be connected).

DSA Typescript

function isConnected(graph: Map<number, number[]>, n: number): boolean {
  const visited = new Set<number>();
  function dfs(node: number) {
    visited.add(node);
    for (const neighbor of graph.get(node) || []) {
      if (!visited.has(neighbor)) {
        dfs([1]);
      }
    }
  }
  dfs(1);
  return visited.size === n;
}

Drag options to blanks, or click blank then click option'

Aneighbor

Bnode

Cgraph

Dvisited

Attempts:

3 left

💡 Hint

Common Mistakes

Calling dfs on the current node again causing infinite recursion.

We must call dfs on the neighbor to visit all connected nodes.

4fill in blank

hard

Fill both blanks to create a function that checks if a graph is a tree by verifying connectivity and edges count.

DSA Typescript

function isTree(graph: Map<number, number[]>, n: number): boolean {
  const edgesCount = [1];
  const connected = isConnected(graph, n);
  return connected && edgesCount === [2];
}

Drag options to blanks, or click blank then click option'

AcountEdges(graph)

Bn - 1

Cgraph.size

Dn + 1

Attempts:

3 left

💡 Hint

Common Mistakes

Using wrong edges count or ignoring connectivity.

A tree must be connected and have exactly n-1 edges.

5fill in blank

hard

Fill all three blanks to implement a function that counts edges in an undirected graph represented by adjacency list.

DSA Typescript

function countEdges(graph: Map<number, number[]>): number {
  let count = 0;
  for (const [1] of graph.values()) {
    count += [2];
  }
  return count [3] 2;
}

Drag options to blanks, or click blank then click option'

Aneighbors

Bneighbors.length

C/

D*

Attempts:

3 left

💡 Hint

Common Mistakes

Not dividing by 2, causing double counting.

We sum the length of neighbors arrays and divide by 2 because edges are counted twice in undirected graphs.

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