LeetCode Problem : Path Sum

Problem

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

Code

bool hps(TreeNode *root, int sum) {
    if(!root)
        return false;
    if(!root->left && !root->right &&
    sum == root->val)
        return true;
    return (hps(root->left,sum - root->val) ||
    hps(root->right,sum - root->val));
}
bool hasPathSum(TreeNode *root, int sum) {
    // Start typing your C/C++ solution below
    // DO NOT write int main() function
    if(!root)
        return false;
    return hps(root,sum );
}