Available question text
Given a binary tree where every node value is contaminated as -1 but the original labels follow root = 0 and for node x, left = 2x+1 and right = 2x+2, recover the correct values and implement find(target) to return whether a node with that label exists in the recovered tree. The solution must support up to 10^4 nodes and 10^4 find queries efficiently.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1261. Find Elements in a Contaminated Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source