Class Solution
java.lang.Object
g0501_0600.s0513_find_bottom_left_tree_value.Solution
513 - Find Bottom Left Tree Value.<p>Medium</p>
<p>Given the <code>root</code> of a binary tree, return the leftmost value in the last row of the tree.</p>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2020/12/14/tree1.jpg" alt="" /></p>
<p><strong>Input:</strong> root = [2,1,3]</p>
<p><strong>Output:</strong> 1</p>
<p><strong>Example 2:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2020/12/14/tree2.jpg" alt="" /></p>
<p><strong>Input:</strong> root = [1,2,3,4,null,5,6,null,null,7]</p>
<p><strong>Output:</strong> 7</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> <= Node.val <= 2<sup>31</sup> - 1</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
findBottomLeftValue
-