LeetCode 每日一题 1261 在受污染的二叉树中查找元素

. - 力扣（LeetCode）

思路：FindElements用中左右/中右左的遍历顺序都是可以的，至于find，可以用一个set或者是map在初始化的时候统计

/**
 * 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 FindElements {
private:
  unordered_set<int> st;
public:
    FindElements(TreeNode* root) {
      reverse(root, 0);
    }

    void reverse(TreeNode* root, int num){
      if(root == nullptr) return;
      root->val = num;
      st.insert(num);
      reverse(root->left, num * 2 + 1);
      reverse(root->right, num * 2 + 2);
    }
    
    bool find(int target) {
       return st.count(target) > 0;
    }
};

/**
 * Your FindElements object will be instantiated and called as such:
 * FindElements* obj = new FindElements(root);
 * bool param_1 = obj->find(target);
 */