Available question text
Given the root of a binary tree, return an array of the maximum value in each level (row) of the tree from top to bottom. This is a level-wise aggregation problem typically solved with a breadth-first traversal (or DFS with depth tracking) to compute the max for each depth.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 515. Find Largest Value in Each Tree Row
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source