Tree: Depth-First Search - Balanced Binary Tree
Consider the optimized recursive balance check code. What is the return value of isBalanced when called on an empty tree (root = None)?
Consider the optimized recursive balance check code. What is the return value of isBalanced when called on an empty tree (root = None)?
medium🧾 Code Trace Q4 of Q15
Step-by-Step Solution
Solution:
Step 1: Trace check_height with root = None
Returns 0 immediately as base case.Step 2: isBalanced returns check_height(root) != -1 -> 0 != -1 -> True
Final Answer:
Option D -> Option DQuick Check:
Empty tree is balanced by definition [OK]
Quick Trick: Empty tree height = 0, balanced [OK]
Common Mistakes:
MISTAKES- Assuming empty tree is unbalanced or causes error
Trap Explanation:
PITFALL- Some candidates forget base case and return False or error on None root.
Interviewer Note:
CONTEXT- Checks handling of edge cases in recursion
Master "Balanced 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