Day 22 of July LeetCode Challenge

Aanchal Patial
1 min readJul 22, 2020

Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree [3,9,20,null,null,15,7],

3
/ \
9 20
/ \
15 7

return its zigzag level order traversal as:

[
[3],
[20,9],
[15,7]
]

--

--

Aanchal Patial

We never really grow up, we only learn how to act in public