Class FindElements

FindElementsInAContaminatedBinaryTree.java:16–33

Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode() {} TreeNode(int val) { this.val = val; } TreeNode(int val, TreeNode left, TreeNode right) { this.val = val; this.left = left; this.right = rig

 * }
 */
class FindElements {
    HashSet<Integer> set = new HashSet<>();
    public FindElements(TreeNode root) {
        dfs(root,0);
    }
    
    public boolean find(int target) {
        return set.contains(target);
        
    }
    public void dfs(TreeNode root, int val){
        if(root==null) return;
        root.val = val;
        set.add(val);
        dfs(root.left, 2*val+1);
        dfs(root.right, 2*val+2);
    }
}

/**
 * Your FindElements object will be instantiated and called as such: