Search results
Burning Tree. Difficulty: Hard Accuracy: 53.53% Submissions: 58K+ Points: 8. Given a binary tree and a node data called target. Find the minimum time required to burn the complete binary tree if the target is set on fire. It is known that in 1 second all nodes connected to a given node get burned.
Apr 18, 2023 · Given a binary tree and target node. By giving the fire to the target node and fire starts to spread in a complete tree. The task is to print the sequence of the burning nodes of a binary tree. Rules for burning the nodes : Fire will spread constantly to the connected nodes only. Every node takes the same time to burn.
Feb 28, 2023 · It is known that in 1s all nodes connected to a given node (left child, right child, and parent) get burned in 1 second. Then all the nodes which are connected through one intermediate get burned in 2 seconds, and so on. The task is to find the minimum time required to burn the complete binary tree. / \.
We would like to show you a description here but the site won’t allow us.
We would like to show you a description here but the site won’t allow us.
Jan 16, 2022 · Hey guys, In this video, We're going to solve an interesting problem called: Minimum Time To Burn A Binary Tree Starting From The Leaf Node. ...more.
Problem Description. Given a binary tree denoted by root node A and a leaf node B from this tree. It is known that all nodes connected to a given node (left child, right child and parent) get burned in 1 second. Then all the nodes which are connected through one intermediate get burned in 2 seconds, and so on.
