Zigzag Level Order Traversal

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).

30:00

Zigzag Level Order Traversal

medium

Topics

Companies

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]]

Constraints:

The number of nodes is in the range $[0, 2000]$ .
$-100 \leq \text{Node.val} \leq 100$

Input

arr ={"root":[3,9,20,null,null,15,7]}

Depth

0

3

9

20

15

7

Variables

Variable	Value
level	0
res	[]

DepthFunction Call

Stack empty

0/25