LeetCode_112 Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ \
7 2 1
return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

public boolean hasPathSum(TreeNode root, int sum) {
        if(root == null) return false;
        return checkSum(root, sum, 0);
    }
    private boolean checkSum(TreeNode root, int sum,int curSum){
        if (root == null) return false;
        if (root.left ==null && root.right== null) {
            return root.val+curSum == sum;
        }
        return checkSum(root.left, sum, curSum+root.val) || checkSum(root.right, sum, curSum+root.val);
    }