Simple java solution


  • 0
    D

    public class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
    if (root == null) return false;

        if (root.left == null && root.right == null) {
            return root.val == sum;
        }
        
        boolean left = hasPathSum(root.left, sum - root.val);
        
        if (left) {
            return true;
        } else {
            return hasPathSum(root.right, sum - root.val); 
        } 
    }
    

    }


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.