Has path sum

HasPathSum.java

package com.interviewbytes.trees;

public class HasPathSum {

    public boolean hasPathSum(TreeNode root, int sum) {

        if (root == null) return false;

        if (root.left == null && root.right == null) return sum == root.val;

        final int nextValue = sum - root.val;
        return hasPathSum(root.left, nextValue) || hasPathSum(root.right, nextValue);
    }
}

TreeNode.java

package com.interviewbytes.trees;

public class TreeNode {

    int val;
    TreeNode left;
    TreeNode right;

    TreeNode(int x) {
        val = x;
    }
}