Sum root to leaf numbers
Given a binary tree as a level-order array (null for missing) where every node value is a digit 0-9, each root-to-leaf path spells a number formed by concatenating the digits from root to leaf. Return the sum of all such numbers. If the tree is empty, return 0.
Implement
sum_root_to_leaf(level: list) → intExamples
in
[[1,2,3]]out25What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 15 min
solution.py
InputExpectedGot
[[1,2,3]]25not run yetsample