Binary Tree Cameras | Dataford Interview Questions

Binary Tree Cameras

Asked in the Round 1 stage. 1 Hard problem in Round 1.

Given a binary tree, place cameras on the minimum number of nodes so every node is monitored. A camera monitors its node, its parent, and its immediate children.

Input and Output

Represent a tree as nested arrays [value, left, right], where an absent child is null. Implement min_camera_cover(root) and return the minimum camera count.

Constraints

0 <= number of nodes <= 1000
Each node has at most two children
The input uses nested arrays of the form [value, left, right]
An absent child is represented by null

Function Signature

def min_camera_cover(root):

Your question is Binary Tree Cameras. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem