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.
Note: A leaf is a node with no children.
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.
方法一:递归
/**
* Definition for a binary tree node.
* 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) {
if(root==NULL)
return false;
if(root->left == NULL && root->right == NULL)
return root->val == sum;
return hasPathSum(root->left,sum-root->val) || hasPathSum(root->right,sum-root->val);
}
};
方法二:非递归
/**
* Definition for a binary tree node.
* 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) {
if(root==nullptr)
return false;
stack<TreeNode*> nodeStack;
TreeNode* last = nullptr;
int current = 0;
while(!nodeStack.empty() || root!=nullptr)
{
if(root)
{
nodeStack.push(root);
current += root->val;
root = root->left;
}
else
{
root = nodeStack.top();
if(root->right && root->right != last)
{
root = root->right;
}
else
{
nodeStack.pop();
last = root;
if(root->left == nullptr && root->right == nullptr)
{
if(current == sum)
return true;
}
current = current - root->val;
root = nullptr;
}
}
}
return false;
}
};