/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool hasPathSum(TreeNode* root, int targetSum) {
if(root==NULL)return false;
stack<pair<TreeNode*,int> >s;
s.push( pair<TreeNode*,int>(root,root->val));
while(!s.empty()){
pair<TreeNode*,int>p=s.top();
s.pop();
if(p.first->left==NULL&&p.first->right==NULL&&p.second==targetSum){
return true;
}
if(p.first->left){
s.push( pair<TreeNode*,int>(p.first->left,p.second+p.first->left->val));
}
if(p.first->right){
s.push( pair<TreeNode*,int>(p.first->right,p.second+p.first->right->val));
}
}
return false;
}
};