LeetCode--Path Sum

标签：leetcode   递归   traversal   bst   tree   

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.

              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.

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool hasPathSum(TreeNode *root, int sum) 
    {
        return hasPathSum(root,sum,0);
    }
    bool hasPathSum(TreeNode *root, int sum, int now) 
    {
        if(root == NULL)
            return false;
        if(root->left == NULL && root->right == NULL && now+root->val == sum)
            return true;
        bool l = hasPathSum(root->left,sum,now+root->val);
        bool r = hasPathSum(root->right,sum,now+root->val);
        return l||r;
    }
};

LeetCode--Path Sum

标签：leetcode   递归   traversal   bst   tree   

原文地址：http://blog.csdn.net/shaya118/article/details/42710717