Tree: Depth-First Search - House Robber III (On Tree)
Consider the optimal House Robber III code. What is the output when the input tree is a single node with value 0?
Consider the optimal House Robber III code. What is the output when the input tree is a single node with value 0?
medium🧾 Code Trace Q4 of Q15
Step-by-Step Solution
Solution:
Step 1: Trace dfs on single node with val=0
dfs returns (rob=0+0+0=0, not_rob=max(0,0)+max(0,0)=0).Step 2: Return max of (0,0)
max(0,0) = 0, so output is 0.Final Answer:
Option A -> Option AQuick Check:
Single node with zero value returns 0 [OK]
Quick Trick: Single node with zero value returns zero max sum [OK]
Common Mistakes:
MISTAKES- Assuming error or non-zero output for zero value node
Trap Explanation:
PITFALL- Candidates may confuse zero value with null or error, but code handles zero correctly.
Interviewer Note:
CONTEXT- Tests boundary condition handling in code trace
Master "House Robber III (On 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