Leetcode 968. Binary Tree Cameras

Place the minimum number of cameras on nodes of a binary tree so every node is monitored by a camera on itself, its parent, or one of its children. This is a tree DP/greedy postorder problem that chooses local placements (camera/covered/uncovered) to minimize total cameras.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 968. Binary Tree Cameras

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact