Tap here to switch tabs
Problem
Submissions

Problem: Binary Tree Cameras

Binary Tree Cameras asks you to find the minimum cameras needed to monitor every node in a binary tree, where each camera covers its node, parent, and immediate children.

Statement

You are given the root of a binary tree. Cameras can be installed on any node, and each camera can monitor itself, its parent, and its immediate children.

Your task is to determine the minimum number of cameras required to monitor every node in the tree.

Constraints:

  • The number of nodes in the tree is in the range [1,1000][1, 1000].

  • Node.data ==0== 0

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Binary Tree Cameras

Binary Tree Cameras asks you to find the minimum cameras needed to monitor every node in a binary tree, where each camera covers its node, parent, and immediate children.

Statement

You are given the root of a binary tree. Cameras can be installed on any node, and each camera can monitor itself, its parent, and its immediate children.

Your task is to determine the minimum number of cameras required to monitor every node in the tree.

Constraints:

  • The number of nodes in the tree is in the range [1,1000][1, 1000].

  • Node.data ==0== 0