Create README - LeetHub

Author: anand-3399

Burning Tree - GFG/README.md

@@ -0,0 +1,58 @@
+# Burning Tree
+## Hard
+<div class="problems_problem_content__Xm_eO"><p><span style="font-size:18px">Given a binary tree and a&nbsp;<strong>node data</strong> called <strong>target</strong>. Find the minimum time required to burn the complete binary tree if the target is set on fire.&nbsp;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.<br>
+<strong>Note:</strong> The tree contains unique values.</span></p>
+
+<p><br>
+<strong><span style="font-size:18px">Example 1:</span></strong></p>
+
+<pre><span style="font-size:18px"><strong>Input:      </strong>
+          1
+        /   \
+      2      3
+    /  \      \
+   4    5      6
+       / \      \
+      7   8      9
+                   \
+                   10</span>
+<span style="font-size:18px">Target Node = 8</span>
+<span style="font-size:18px"><strong>Output:</strong> 7</span>
+<span style="font-size:18px"><strong>Explanation:</strong> If leaf with the value 
+8 is set on fire. 
+After 1 sec: 5 is set on fire.
+After 2 sec: 2, 7 are set to fire.
+After 3 sec: 4, 1 are set to fire.
+After 4 sec: 3 is set to fire.
+After 5 sec: 6 is set to fire.
+After 6 sec: 9 is set to fire.
+After 7 sec: 10 is set to fire.
+It takes 7s to burn the complete tree.</span>
+</pre>
+
+<p><span style="font-size:18px"><strong>Example 2:</strong></span></p>
+
+<pre><span style="font-size:18px"><strong>Input:</strong>      
+          1
+        /   \
+      2      3
+    /  \      \
+   4    5      7
+  /    / 
+ 8    10</span>
+<span style="font-size:18px">Target Node = 10</span>
+<span style="font-size:18px"><strong>Output:</strong> 5</span>
+</pre>
+
+<p><br>
+<span style="font-size:18px"><strong>Your Task: &nbsp;</strong><br>
+You don't need to read input or print anything. Complete the function <strong>minTime()</strong> which takes the root of the tree and target as input parameters and returns the minimum time required to burn the complete binary tree if the target is set on fire at the 0th second.</span></p>
+
+<p><br>
+<span style="font-size:18px"><strong>Expected Time Complexity: </strong>O(N)<br>
+<strong>Expected Auxiliary Space: </strong>O(height of tree)</span></p>
+
+<p><br>
+<span style="font-size:18px"><strong>Constraints:</strong><br>
+1 ≤ N ≤ 10<sup>4</sup></span></p>
+</div>