Tree: Depth-First Search - Path Sum
What does the function return for a single-node tree with value 0 and targetSum=0 using the optimal DFS code?
What does the function return for a single-node tree with value 0 and targetSum=0 using the optimal DFS code?
medium🧾 Code Trace Q4 of Q15
Step-by-Step Solution
Solution:
Step 1: Check leaf node condition for single node
Node is leaf (no children), sum = 0 + 0 = 0.Step 2: Compare sum with targetSum
Sum equals targetSum, so function returns True.Final Answer:
Option B -> Option BQuick Check:
Single node equals target -> True [OK]
Quick Trick: Single node with value equals target -> True [OK]
Common Mistakes:
MISTAKES- Returning False for zero value
- Not handling leaf node correctly
Trap Explanation:
PITFALL- Candidates may overlook that leaf node sum can be zero and still valid.
Interviewer Note:
CONTEXT- Tests edge case handling for minimal tree input.
Master "Path Sum" 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