sundeepblue
3/17/2014 - 2:49 PM

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 gi

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.

Path Sum.cpp
content_copyfile_download
bool hasPathSum(TreeNode *root, int sum) {
    if(!root) return false;
    if(sum == root->val && root->left == NULL && root->right == NULL) return true;
    return hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val);
}