Solution: Binary Tree Zigzag Level Order Traversal

Let's solve the Binary Tree Zigzag Level Order Traversal problem using the Tree Breadth First Search pattern.

Statement

Given a binary tree, return its zigzag level order traversal. The zigzag level order traversal corresponds to traversing nodes from left to right for one level, right to left for the next level, and so on, reversing the direction after every level.

Constraints:

  • The number of nodes in the tree is in the range 00 to 500500.

  • −100≤-100 \leq node.data ≤100\leq 100

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.