# 515. Find Largest Value in Each Tree Row LeetCode Solution Share:

Find Largest Value in Each Tree Row 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, 104]`.
• `-231 <= Node.val <= 231 - 1`

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, 104]`.
• `-231 <= Node.val <= 231 - 1`

Time: O(n)
Space: O(n)

### C++

`` Will be updated Soon``

### Java

``````
Will be updated Soon``````

### Python

``````  Will be updated Soon
``````

#### Watch Tutorial

Checkout more Solutions here