public class Solution {
public boolean hasPathSum(TreeNode root, int sum) {
// Start typing your Java solution below
// DO NOT write main() function
if(root == null) return false;
if(root.val == sum && root.left == null && root.right == null) return true;
else{
return hasPathSum(root.left,sum-root.val)||hasPathSum(root.right,sum-root.val);
}
}
}