[Solved] The following recursive code attempts to c... Identify the bug: ```python def maxDepth(root): if root is None: return 0 left = maxDepth(root.left) right = maxDepth(root.right) return left + right ``` | Tree: Depth-First Search

Tree: Depth-First Search - Maximum Depth of Binary Tree

The following recursive code attempts to compute the maximum depth of a binary tree. Identify the bug: ```python def maxDepth(root): if root is None: return 0 left = maxDepth(root.left) right = maxDepth(root.right) return left + right ```

ADoes not handle None root case

BReturns sum of left and right depths instead of max, overestimating depth

CForgets to add 1 for current node depth

DUses BFS instead of DFS

Step-by-Step Solution

Solution:

Step 1: Analyze return statement
Returns left + right instead of 1 + max(left, right).
Step 2: Understand impact
Sum overestimates depth by combining both subtree depths instead of choosing the deeper one.
Final Answer:
Option B -> Option B
Quick Check:
Max depth requires max, not sum [OK]

Quick Trick: Max depth uses max(), not sum() [OK]

Common Mistakes:

MISTAKES

Summing depths instead of max
Ignoring base case
Off-by-one errors in depth calculation

Trap Explanation:

PITFALL

Candidates confuse max depth with total nodes count, summing depths incorrectly.

Interviewer Note:

CONTEXT

Tests ability to spot subtle logic bugs in recursive depth calculation.

Master "Maximum Depth of Binary Tree" in Tree: Depth-First Search

3 interactive learning modes - each teaches the same concept differently

Try It Solution Trace

More Tree: Depth-First Search Quizzes

Identify the bug: ```python def maxDepth(root): if root is None: return 0 left = maxDepth(root.left) right = maxDepth(root.right) return left + right ```

Step 1: Analyze return statement

Step 2: Understand impact

Final Answer:

Quick Check:

Want More Practice?