Sum Root to Leaf Numbers
You are given the root of a binary tree. Every node holds a single digit 0 to 9. Reading the digits along a root-to-leaf path gives a number (the path 1 -> 2 -> 3 is 123). Return the sum of the numbers of all root-to-leaf paths. An empty tree gives 0.
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [1,2,3]
returns 25
12 + 13 = 25.
Constraints
0 <= number of nodes <= 1000 <= node.val <= 9
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.