Practice Find Largest Value in Each Tree Row
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Medium#515
LeetCode ProblemFind Largest Value in Each Tree Row
Problem Statement
Given the root of a binary tree, return an array of the largest value in each row of the tree (0-indexed).
Source: Find Largest Value in Each Tree Row on LeetCode. Use the original task for its coding environment and submissions.
Examples
# 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^4].
-2^31 <= Node.val <= 2^31 - 1
Related LeetCode Problems
Practice more problems similar to Find Largest Value in Each Tree Row.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.