Burning Tree 2

medium

1. Given a binary tree and target. 
2. Find the minimum time required to burn the complete binary tree if the target is set on fire. 
3. It is known that in 1 second all nodes connected to a given node get burned. That is, its left child, right child and parent.

Input Format

Input is managed for you.

Output Format

Output is managed for you.

Constraints

1. The number of nodes in the tree is in the range [1, 10000].
2. -1000 &lt;= Node.val &lt;= 1000
3. All the values Node.val are unique.
4. target is the value of one of the nodes in the tree.

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

Output

Burning Tree

Maximum Width Of Binary Tree

Related Questions

easy Add One Row To Tree easy Cameras In Binary Tree easy House Robber In Binary Tree easy Longest Zigzag Path In A Binary Tree easy Validate Bst easy Recover Bst easy Construct Binarytree From Preorder And Inorder Traversal medium Construct Binarytree From Postorder And Inorder Traversal easy Construct Bst From Inorder Traversal easy Construct Bst From Preorder Traversal easy Construct Bst From Postorder Traversal medium Construct Bst From Levelorder Traversal easy Serialize And Deserialize Binary Tree easy Construct Binary Tree From Preorder And Postorder Traversal easy Left View Of A Binarytree easy Right View Of A Binarytree