FunctionRacerProblemsRace

Largest Value in Each Row

EasyTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Return the largest value on each level of the tree, top to bottom. An empty tree gives [].

Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.

Example 1

root [1,3,2,5,3,null,9]
returns [1,3,9]

Level maxima: 1, 3, 9.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems