Tree: Depth-First Search - Sum Root to Leaf Numbers
Consider the same Morris Preorder Traversal code for summing root-to-leaf numbers. What is the output when the tree consists of a single node with value 0?
Consider the same Morris Preorder Traversal code for summing root-to-leaf numbers. What is the output when the tree consists of a single node with value 0?
medium🧾 Code Trace Q4 of Q15
Step-by-Step Solution
Solution:
Step 1: Trace the single node path
Only one root-to-leaf path: node value 0.Step 2: Calculate the number formed
current_number = 0 * 10 + 0 = 0; sum is 0.Final Answer:
Option D -> Option DQuick Check:
Single node 0 forms number 0 [OK]
Quick Trick: Single node value equals sum [OK]
Common Mistakes:
MISTAKES- Returning None for single node
- Mistaking 0 for 1 or 10
Trap Explanation:
PITFALL- Some candidates assume sum must be at least 1 or confuse empty tree with single node zero.
Interviewer Note:
CONTEXT- Tests handling of edge cases with minimal input.
Master "Sum Root to Leaf Numbers" 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