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
1
/ \
3 2
/ \ \
5 3 9Input
root = [1,3,2,5,3,null,9]Output
[1,3,9]The largest values in rows 0, 1, and 2 are 1, 3, and 9 respectively.
Example 2
1
/ \
2 3Input
root = [1,2,3]Output
[1,3]The largest values in rows 0 and 1 are 1 and 3 respectively.
Constraints
- The number of nodes in the tree will be in the range [0, 10^4].
- -2^31 <= Node.val <= 2^31 - 1