leetcode/Path Sum at master · divya1509/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
/**
 * 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 hasPathSum(TreeNode root, int sum) {
        if(root == null) return false;

        sum -= root.val;

        if(root.left == null && root.right == null) {
            if(sum == 0) return true;
            else return false;
        }

        if(root.left != null && hasPathSum(root.left, sum)) return true;
        if(root.right != null && hasPathSum(root.right, sum)) return true;
        return false;
    }
}