1261. Find Elements in a Contaminated Binary Tree
Medium
30 Points
Hash Table
Tree
Depth-First Search
Breadth-First Search
Design
Binary Tree
Given a binary tree with the following rules:
Now the binary tree is contaminated, which means all treeNode.val have been changed to -1.
Implement the FindElements class:
Examples
Example 1
Input
["FindElements","find","find"]
[[[-1,null,-1]],[1],[2]]
Output
[null,false,true]
Explanation
FindElements findElements = new FindElements([-1,null,-1]);
findElements.find(1); // return False
findElements.find(2); // return True
Example 2
Input
["FindElements","find","find","find"]
[[[-1,-1,-1,-1,-1]],[1],[3],[5]]
Output
[null,true,true,false]
Explanation
FindElements findElements = new FindElements([-1,-1,-1,-1,-1]);
findElements.find(1); // return True
findElements.find(3); // return True
findElements.find(5); // return False
Example 3
Input
["FindElements","find","find","find","find"]
[[[-1,null,-1,-1,null,-1]],[2],[3],[4],[5]]
Output
[null,true,false,false,true]
Explanation
FindElements findElements = new FindElements([-1,null,-1,-1,null,-1]);
findElements.find(2); // return True
findElements.find(3); // return False
findElements.find(4); // return False
findElements.find(5); // return True
Constraints
TreeNode.val == -1The height of the binary tree is less than or equal to 20The total number of nodes is between [1, 104]Total calls of find() is between [1, 104]0 <= target <= 106
1261. Find Elements in a Contaminated Binary Tree
Medium
30 Points
Hash Table
Tree
Depth-First Search
Breadth-First Search
Design
Binary Tree
Given a binary tree with the following rules:
Now the binary tree is contaminated, which means all treeNode.val have been changed to -1.
Implement the FindElements class:
Examples
Example 1
Input
["FindElements","find","find"]
[[[-1,null,-1]],[1],[2]]
Output
[null,false,true]
Explanation
FindElements findElements = new FindElements([-1,null,-1]);
findElements.find(1); // return False
findElements.find(2); // return True
Example 2
Input
["FindElements","find","find","find"]
[[[-1,-1,-1,-1,-1]],[1],[3],[5]]
Output
[null,true,true,false]
Explanation
FindElements findElements = new FindElements([-1,-1,-1,-1,-1]);
findElements.find(1); // return True
findElements.find(3); // return True
findElements.find(5); // return False
Example 3
Input
["FindElements","find","find","find","find"]
[[[-1,null,-1,-1,null,-1]],[2],[3],[4],[5]]
Output
[null,true,false,false,true]
Explanation
FindElements findElements = new FindElements([-1,null,-1,-1,null,-1]);
findElements.find(2); // return True
findElements.find(3); // return False
findElements.find(4); // return False
findElements.find(5); // return True
Constraints
TreeNode.val == -1The height of the binary tree is less than or equal to 20The total number of nodes is between [1, 104]Total calls of find() is between [1, 104]0 <= target <= 106