@@ -0,0 +1,745 @@
+/**%0A * Problem Link: https://leetcode.com/problems/sum-root-to-leaf-numbers/%0A * %0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    private int sum;%0A    public int sumNumbers(TreeNode root) %7B%0A        sum = 0;%0A        sumTrav(root, 0);%0A        return sum;%0A    %7D%0A    %0A    private void sumTrav(TreeNode root, int s) %7B%0A        if(root == null) %7B%0A            return;%0A        %7D%0A        if(root.left == null && root.right == null) %7B%0A            sum += s * 10 + root.val;%0A            return;%0A        %7D%0A        sumTrav(root.left, s * 10 + root.val);%0A        sumTrav(root.right, s * 10 + root.val);%0A    %7D%0A%7D%0A

Create Sum_Root_to_Leaf_Numbers.java