Path Sum

/**
* Definition for binary tree
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
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;
return find(root,sum);
}
private boolean find(TreeNode node,int num){
if(node==null)return false;
else if(node.left!=null||node.right!=null){
return find(node.left,num-node.val)||find(node.right,num-node.val);
}
else return node.val==num;

}
}