Class Solution
java.lang.Object
g0501_0600.s0515_find_largest_value_in_each_tree_row.Solution
515 - Find Largest Value in Each Tree Row.<p>Medium</p>
<p>Given the <code>root</code> of a binary tree, return <em>an array of the largest value in each row</em> of the tree <strong>(0-indexed)</strong>.</p>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" alt="" /></p>
<p><strong>Input:</strong> root = [1,3,2,5,3,null,9]</p>
<p><strong>Output:</strong> [1,3,9]</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> root = [1,2,3]</p>
<p><strong>Output:</strong> [1,3]</p>
<p><strong>Constraints:</strong></p>
<ul>
<li>The number of nodes in the tree will be in the range <code>[0, 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
-
largestValues
-