题目链接:https://leetcode-cn.com/problems/two-sum-iv-input-is-a-bst/
题目如下:
/**
* 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:
unordered_set<int> set;
bool flag=false;
void dfs(TreeNode* root,int k){
if(!root) return ;
if(flag) return ;//这一步叫剪枝
dfs(root->left,k);
if(set.count(k-root->val)!=0) flag=true;
else set.insert(root->val);
dfs(root->right,k);
}
bool findTarget(TreeNode* root, int k) {
dfs(root,k);
return flag;
}
};