Accepted java solution


  • 2
    D
    public boolean hasPathSum(TreeNode root, int sum) {
            if(root == null)return false;
            sum -= root.val;
            if((root.left==null)&&(root.right==null)) return sum==0;
            return hasPathSum(root.left,sum) || hasPathSum(root.right,sum);
           
        }

Log in to reply
 

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