Binary Tree Zigzag Level Order Traversal, is a LeetCode problem. In this post we will see how we can solve this challenge in Python

Problem Description

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

You can find the full details of the problem Binary Tree Zigzag Level Order Traversal at LeetCode

Solution: Please check the main.py snippet for the solution.

This solution originally posted at: Github by @kamyu104