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.