acodeaday/0112. Path Sum at master · Hardik-dot/acodeaday · 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
/**
 * 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 {
    public boolean aux(TreeNode root, int ts){
        if(root==null)
            return false;
        if(root.left==null&&root.right==null){
            if(ts-root.val==0)
                return true;
            return false;
        }

        if(aux(root.left,ts-root.val))
            return true;
        if(aux(root.right,ts-root.val))
            return true;
        return false;
    }
    public boolean hasPathSum(TreeNode root, int targetSum) {
        return aux(root,targetSum);

    }
}