剑指offer25 -- LeetCode #112 Path Sum

public class test25 {
    public boolean hasPathSum(TreeNode root, int sum) {
        if(root == null)
            return false;
        if(root.left == null && root.right == null && root.val==sum)
            return true;
        if(hasPathSum(root.left, sum-root.val))
            return true;
        if(hasPathSum(root.right, sum-root.val))
            return true;
        return false;
    }
}