Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0501_0600.s0515_find_largest_value_in_each_tree_row.Solution

```
public class Solution
extends Object
```
515 - Find Largest Value in Each Tree Row.
Medium

Given the root of a binary tree, return an array of the largest value in each row of the tree (0-indexed).

Example 1:

Input: root = [1,3,2,5,3,null,9]

Output: [1,3,9]

Example 2:

Input: root = [1,2,3]

Output: [1,3]

Constraints:
- The number of nodes in the tree will be in the range [0, 10⁴].
- -2³¹ <= Node.val <= 2³¹ - 1

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  List<Integer> largestValues(TreeNode root)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

largestValues

public List<Integer> largestValues(TreeNode root)