#89Hard#36 in Oracle's list· asked at 6 companies
Binary Tree Cameras
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: root = [0,0,null,0,0] Output: 1
One camera at the middle node covers everything.
Example 2
Input: root = [0,0,null,0,null,0,null,null,0] Output: 2
Constraints
- •
The number of nodes in the tree is in the range
[1, 1000]. - •
Node.val == 0