Spiral/Zigzag level order traversal of binary tree in java

If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions.

This is 6th part of java binary tree tutorial.

In this post, we will see about Spiral/Zigzag Level Order binary tree traversal in java.

Spiral/Zigzag Level Order traversal:

Spiral/Zigzag Level order traversal of below tree will be:

Steps for solution:

1. Create an empty stack s and push root to it.
2. while stack is not NULL Do following
   1. Create a empty stack called tempStack.
   2. Pop a node from stack and push it to tempStack depending on directionFlag
   3. Change directionFlag to change the direction of traversal
   4. set stack=tempStack

Example:
Lets say your binary tree is :

So Spiral/Zigzag Level Order traversal will work as below:

Lets create java program for Spiral/Zigzag Level traversal:

Run above program and you will get following output:

Java Binary tree tutorial:

• Binary tree in java
• Binary tree preorder traversal
• Binary tree postorder traversal
• Binary tree inorder traversal
• Binary tree level order traversal
• Binary tree spiral order traversal
• Binary tree reverse level order traversal
• Binary tree boundary traversal
• Print leaf nodes of binary tree
• Count leaf nodes in binary tree
• get maximum element in binary tree
• Print all paths from root to leaf in binary tree
• Print vertical sum of binary tree in java
• Get level of node in binary tree in java
• Lowest common ancestor(LCA) in binary tree in java