Problem · Tree
Binary Tree Cameras
● Hard
AmazonFULLTIMEOA
See Amazon hiring insightsAmazonFULLTIMEOAProblem statement
You are given the root of a binary tree. You may install cameras on its nodes.
A camera installed at a node monitors that node, its parent if one exists, and its immediate children.
The problem statement continues
ProExamples
Example 1
root = [0,0,null,0,0]return = 1Place one camera on the second node in the level-order representation. It monitors its parent, itself, and both of its children, so every node is covered.
Original screenshot from the interview report
ProFastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week