0103-binary-tree-zigzag-level-order-traversal¶
Try it on leetcode
Description¶
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).
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
Solution(Python)¶
# Definition for a binary tree node.
from collections import deque
class TreeNode:
def __init__(self, val=0, left=None, right=None):
self.val = val
self.left = left
self.right = right
class Solution:
def zigzagLevelOrder(self, root: TreeNode | None) -> list[list[int]]:
if not root:
return []
levels = []
q = deque([root])
invert = False
while q:
level = []
level_size = len(q)
for _ in range(level_size):
node = q.popleft()
for child in [node.left, node.right]:
if child:
q.append(child)
level.append(node.val)
if invert:
level.reverse()
invert = not invert
levels.append(level)
return levels