Tree: Depth-First Search - Diameter of Binary Tree
Consider the optimized recursive diameter code. What is the diameter returned for a single-node tree (root only)?
Consider the optimized recursive diameter code. What is the diameter returned for a single-node tree (root only)?
medium🧾 Code Trace Q4 of Q15
Step-by-Step Solution
Solution:
Step 1: Trace height for single node
Height of root is 1, left and right children are null with height 0.Step 2: Calculate diameter
Diameter = max(0, 0 + 0) = 0, so function returns 0.Final Answer:
Option C -> Option CQuick Check:
Diameter of single node tree is 0 edges [OK]
Quick Trick: Diameter counts edges, single node -> 0
Common Mistakes:
MISTAKES- Returning 1 instead of 0 for single node
- Confusing nodes with edges in diameter
Trap Explanation:
PITFALL- Candidates often return 1 for single node diameter, forgetting diameter counts edges, not nodes.
Interviewer Note:
CONTEXT- Tests handling of edge cases in recursive diameter code
Master "Diameter of Binary Tree" in Tree: Depth-First Search
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Tree: Depth-First Search Quizzes