Height of Binary Tree After Subtree Removal Queries
Try to solve the Height of Binary Tree After Subtree Removal Queries problem.
We'll cover the following
Statement
We are given the root
of a binary tree with queries
, of size
Note: A tree’s height is the number of edges in the longest path from the root to any leaf node in the tree.
A few points to be considered:
All the values in the tree are unique.
It is guaranteed thatÂ
queries[i]
 will not be equal to the value of the root.The queries are independent, so the tree returns to its initial state after each query.
Constraints:
Node.data
== queries.length
, queries[i]
queries[i]
root.data
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.