Class Solution
java.lang.Object
g2401_2500.s2458_height_of_binary_tree_after_subtree_removal_queries.Solution
2458 - Height of Binary Tree After Subtree Removal Queries.<p>Hard</p>
<p>You are given the <code>root</code> of a <strong>binary tree</strong> with <code>n</code> nodes. Each node is assigned a unique value from <code>1</code> to <code>n</code>. You are also given an array <code>queries</code> of size <code>m</code>.</p>
<p>You have to perform <code>m</code> <strong>independent</strong> queries on the tree where in the <code>i<sup>th</sup></code> query you do the following:</p>
<ul>
<li><strong>Remove</strong> the subtree rooted at the node with the value <code>queries[i]</code> from the tree. It is <strong>guaranteed</strong> that <code>queries[i]</code> will <strong>not</strong> be equal to the value of the root.</li>
</ul>
<p>Return <em>an array</em> <code>answer</code> <em>of size</em> <code>m</code> <em>where</em> <code>answer[i]</code> <em>is the height of the tree after performing the</em> <code>i<sup>th</sup></code> <em>query</em>.</p>
<p><strong>Note</strong>:</p>
<ul>
<li>The queries are independent, so the tree returns to its <strong>initial</strong> state after each query.</li>
<li>The height of a tree is the <strong>number of edges in the longest simple path</strong> from the root to some node in the tree.</li>
</ul>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2022/09/07/binaryytreeedrawio-1.png" alt="" /></p>
<p><strong>Input:</strong> root = [1,3,4,2,null,6,5,null,null,null,null,null,7], queries = [4]</p>
<p><strong>Output:</strong> [2]</p>
<p><strong>Explanation:</strong> The diagram above shows the tree after removing the subtree rooted at node with value 4. The height of the tree is 2 (The path 1 -> 3 -> 2).</p>
<p><strong>Example 2:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2022/09/07/binaryytreeedrawio-2.png" alt="" /></p>
<p><strong>Input:</strong> root = [5,8,9,2,1,3,7,4,6], queries = [3,2,4,8]</p>
<p><strong>Output:</strong> [3,2,3,2]</p>
<p><strong>Explanation:</strong> We have the following queries:</p>
<ul>
<li>
<p>Removing the subtree rooted at node with value 3. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 4).</p>
</li>
<li>
<p>Removing the subtree rooted at node with value 2. The height of the tree becomes 2 (The path 5 -> 8 -> 1).</p>
</li>
<li>
<p>Removing the subtree rooted at node with value 4. The height of the tree becomes 3 (The path 5 -> 8 -> 2 -> 6).</p>
</li>
<li>
<p>Removing the subtree rooted at node with value 8. The height of the tree becomes 2 (The path 5 -> 9 -> 3).</p>
</li>
</ul>
<p><strong>Constraints:</strong></p>
<ul>
<li>The number of nodes in the tree is <code>n</code>.</li>
<li><code>2 <= n <= 10<sup>5</sup></code></li>
<li><code>1 <= Node.val <= n</code></li>
<li>All the values in the tree are <strong>unique</strong>.</li>
<li><code>m == queries.length</code></li>
<li><code>1 <= m <= min(n, 10<sup>4</sup>)</code></li>
<li><code>1 <= queries[i] <= n</code></li>
<li><code>queries[i] != root.val</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
treeQueries
-