Binary Tree Zigzag Level Order Traversal is an example of tree problems. In this post we will see how we can solve in Javascript.

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

Implementation: Please check the main.js snippet for the solution.  If you have different approach in mind or have any suggestion for this implementation feel free to share in the comment below. Thanks!