Freaks City

Greedy Algorithm: Minimum Cameras to Monitor a Binary Tree Given a binary tree, we need to place cameras on nodes such that every node in the tree is monitored. A camera placed on a node monitors itself, its parenet, and its immediate children. Determine the minimum number of cameras required. Approach We can solve this problem using a greedy a ...