Class Solution
java.lang.Object
g2301_2400.s2385_amount_of_time_for_binary_tree_to_be_infected.Solution
2385 - Amount of Time for Binary Tree to Be Infected.<p>Medium</p>
<p>You are given the <code>root</code> of a binary tree with <strong>unique</strong> values, and an integer <code>start</code>. At minute <code>0</code>, an <strong>infection</strong> starts from the node with value <code>start</code>.</p>
<p>Each minute, a node becomes infected if:</p>
<ul>
<li>The node is currently uninfected.</li>
<li>The node is adjacent to an infected node.</li>
</ul>
<p>Return <em>the number of minutes needed for the entire tree to be infected.</em></p>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2022/06/25/image-20220625231744-1.png" alt="" /></p>
<p><strong>Input:</strong> root = [1,5,3,null,4,10,6,9,2], start = 3</p>
<p><strong>Output:</strong> 4</p>
<p><strong>Explanation:</strong> The following nodes are infected during:</p>
<ul>
<li>
<p>Minute 0: Node 3</p>
</li>
<li>
<p>Minute 1: Nodes 1, 10 and 6</p>
</li>
<li>
<p>Minute 2: Node 5</p>
</li>
<li>
<p>Minute 3: Node 4</p>
</li>
<li>
<p>Minute 4: Nodes 9 and 2</p>
</li>
</ul>
<p>It takes 4 minutes for the whole tree to be infected so we return 4.</p>
<p><strong>Example 2:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2022/06/25/image-20220625231812-2.png" alt="" /></p>
<p><strong>Input:</strong> root = [1], start = 1</p>
<p><strong>Output:</strong> 0</p>
<p><strong>Explanation:</strong> At minute 0, the only node in the tree is infected so we return 0.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li>The number of nodes in the tree is in the range <code>[1, 10<sup>5</sup>]</code>.</li>
<li><code>1 <= Node.val <= 10<sup>5</sup></code></li>
<li>Each node has a <strong>unique</strong> value.</li>
<li>A node with a value of <code>start</code> exists in the tree.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
amountOfTime
-