FunctionRacerProblemsRace

Zigzag Level Order Traversal

EasyTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Return the values level by level, but alternate the direction: level 0 (the root) goes left to right, level 1 goes right to left, level 2 goes left to right again, and so on. Return a list of lists. 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 [3,9,20,null,null,15,7]
returns [[3],[20,9],[15,7]]

Level 1 is reversed: [20, 9]. Level 2 is normal: [15, 7].

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