mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
29 lines
1.2 KiB
HTML
29 lines
1.2 KiB
HTML
<p>You are given the <code>root</code> of a binary tree. We install cameras on the tree nodes where each camera at a node can monitor its parent, itself, and its immediate children.</p>
|
|
|
|
<p>Return <em>the minimum number of cameras needed to monitor all nodes of the tree</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/29/bst_cameras_01.png" style="width: 138px; height: 163px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [0,0,null,0,0]
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong> One camera is enough to monitor all nodes if placed as shown.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/29/bst_cameras_02.png" style="width: 139px; height: 312px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [0,0,null,0,null,0,null,null,0]
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong> At least two cameras are needed to monitor all nodes of the tree. The above image shows one of the valid configurations of camera placement.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of nodes in the tree is in the range <code>[1, 1000]</code>.</li>
|
|
<li><code>Node.val == 0</code></li>
|
|
</ul>
|