Find Largest Value in Each Tree Row
Medium
Topics
Given the root of a binary tree, return an array containing the largest value in each row (level), ordered from the top row to the bottom row.
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
- 0 <= number of nodes <= 10^4
- -2^31 <= Node.val <= 2^31 - 1
Run ⌘' · Submit ⌘⏎
SensAI