Given a binary tree containing digits from only 0-9
, each root-to-leaf path could represent a number.
An example is the Root-to-leaf path 1->2->3
which represents the number 123
.
Find The total sum of all root-to-leaf numbers.
For example,
1 / 2 3
The Root-to-leaf path 1->2
represents the number 12
.
The Root-to-leaf path 1->3
represents the number 13
.
Return the sum = + = 25
.
Subscribe to see which companies asked this question
1 /**2 * Definition for a binary tree node.3 * public class TreeNode {4 * int val;5 * TreeNode left;6 * TreeNode right;7 * TreeNode (int x) {val = x;}8 * }9 */Ten Public classSolution { One intsum = 0; A Public intsumnumbers (TreeNode root) { - if(Root = =NULL)return0; -Findsum (root,0); the returnsum; - } - - Public voidFindsum (TreeNode root,inttmp) { + if(Root.left = =NULL&& Root.right = =NULL){ -Sum + = 10*tmp +Root.val; + return; A } at if(Root.left! =NULL) Findsum (Root.left, 10*tmp +root.val); - - if(Root.right! =NULL) Findsum (root.right, 10*tmp +root.val); - } -}
129. Sum Root to Leaf Numbers Java Solutions