Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Binary Tree Cameras
Bookmark
Brute Force
Three-State DP
Greedy DFS
Input
Small Tree
Medium Tree
Skewed Tree
Custom
tree
=
[0, 0, null, 0, 0]
0
0
0
0
cameras
0
0
0
0
0
cameras
0
0
0
0
0
cam
cov
unc
cameras
4
mask
0001
→
not a cover
0
0
0
0
cam
cam
cov
cov
cameras
1
node
0
is
covered
0
0
0
0
cam
cov
cov
cameras
1
node
0
is
exposed
0
0
0
0
cam
cam
cam
cov
cameras
1
mask
0111
·
3
camera(s)
0
0
0
0
cam
cov
cam
cameras
1
mask
1001
·
2
camera(s)
0
0
0
0
cov
cam
cov
cam
cameras
1
best so far =
1
camera(s)
0
0
0
0
unc
cov
cam
cam
cameras
1
mask
1100
→
not a cover
0
0
0
0
cov
cam
cov
cam
cameras
1
node
0
is
covered
0
0
0
0
cameras
1
minimum cameras = 1
algo
master
.
io
Step:
Start Binary Tree Cameras: try every camera subset
0 / 126
Input
Small Tree
Medium Tree
Skewed Tree
Custom
tree
=
[0, 0, null, 0, 0]
0 / 126
algo
master
.
io
Step:
Start Binary Tree Cameras: try every camera subset
