DSA-Java-Leetcode/129. Sum Root to Leaf Numbers at main · risitadas/DSA-Java-Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {


    int result = 0;

    public void dfs(TreeNode root, int path)
    {

        if(root == null)
        {
            return;


        }

        if(root.left == null && root.right == null)
        {
            result += path * 10 + root.val;
            return;
        }

        dfs(root.left, path * 10 + root.val);
        dfs(root.right, path * 10 + root.val);


    }


    public int sumNumbers(TreeNode root)
    {
        dfs(root, 0);
        return result;
    }


}