@@ -0,0 +1,829 @@
+/**%0A * Definition for binary tree%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    public int sumNumbers(TreeNode root) %7B%0A      if (root == null) %0A        return 0;%0A        %0A      return sumNumbersRecv(root, 0);%0A    %7D%0A%0A    private int sumNumbersRecv(TreeNode root, int preVal) %7B%0A        assert (root != null);%0A        %0A        int curVal = preVal*10 + root.val;%0A        if (root.left == null && root.right == null) %7B%0A            return curVal;%0A        %7D%0A        %0A        int sum = 0;%0A        if (root.left != null) %7B%0A            sum += sumNumbersRecv(root.left, curVal);%0A        %7D%0A        if (root.right != null) %7B%0A            sum += sumNumbersRecv(root.right, curVal);%0A        %7D%0A        %0A        return sum;%0A    %7D%0A%7D%0A

Create Sum_Root_to_Leaf_Numbers.java