FunctionRacerProblemsRace

Values on Odd Levels

EasyTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. The root is on level 0, its children on level 1, and so on. Return the values of all nodes on odd levels (1, 3, 5, ...) in level order, left to right, as one flat list. 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,2,3,4,5,6,7]
returns [2,3]

Level 1 holds 2 and 3. Level 3 does not exist.

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