Create README - LeetHub

Author: JanaSabuj

Diff for: find-bottom-left-tree-value/README.md

@@ -0,0 +1,23 @@
+<h2>513. Find Bottom Left Tree Value</h2><h3>Medium</h3><hr><div><p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" style="width: 302px; height: 182px;">
+<pre><strong>Input:</strong> root = [2,1,3]
+<strong>Output:</strong> 1
+</pre>
+
+<p><strong>Example 2:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2020/12/14/tree2.jpg" style="width: 432px; height: 421px;">
+<pre><strong>Input:</strong> root = [1,2,3,4,null,5,6,null,null,7]
+<strong>Output:</strong> 7
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>The number of nodes in the tree is in the range <code>[1, 10<sup>4</sup>]</code>.</li>
+	<li><code>-2<sup>31</sup> &lt;= Node.val &lt;= 2<sup>31</sup> - 1</code></li>
+</ul>
+</div>