Practice Binary Tree Zigzag Level Order Traversal
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Medium#103
LeetCode ProblemBinary Tree Zigzag Level Order Traversal
Problem Statement
Given the root of a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).
Source: Binary Tree Zigzag Level Order Traversal on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [3,9,20,null,null,15,7]
Output
[[3],[20,9],[15,7]]
# Example 2
Input
root = [1]
Output
[[1]]
# Example 3
Input
root = []
Output
[]
Constraints
The number of nodes in the tree is in the range [0, 2000].
-100 <= Node.val <= 100
Related LeetCode Problems
Practice more problems similar to Binary Tree Zigzag Level Order Traversal.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.