Adding Zig-Zag Traversal For Tree Data Structures.

[Harshal-Jadhav]

Is your feature request related to a problem? Please describe.

• The Problem is to Print the give tree in Zig-Zag order.
• This is a very Good Question I want to Contribute For.
• This Question Has Been Asked by many Interviewers.

I would be very Glad if you allow me to Contribute over this Problem.

Additional context
I would also like to Add few more Questions like

• Left View Or the Right View of the Tree.

[dhruvchawla99]

import java.util.*;
class Node
{
int data;
Node leftChild;
Node rightChild;
Node(int data)
{
this.data = data;
}
}

class BinaryTree {
Node rootNode;
void printZigZagTraversal() {

if (rootNode == null) {
return;
}


Stack<Node> currentLevel = new Stack<>();
Stack<Node> nextLevel = new Stack<>();


currentLevel.push(rootNode);
boolean leftToRight = true;


while (!currentLevel.isEmpty()) {


Node node = currentLevel.pop();

System.out.print(node.data + " ");

if (leftToRight) {
    if (node.leftChild != null) {
    nextLevel.push(node.leftChild);
    }
     
    if (node.rightChild != null) {
    nextLevel.push(node.rightChild);
    }
}
else {
    if (node.rightChild != null) {
    nextLevel.push(node.rightChild);
    }
     
    if (node.leftChild != null) {
    nextLevel.push(node.leftChild);
    }
}

if (currentLevel.isEmpty()) {
    leftToRight = !leftToRight;
    Stack<Node> temp = currentLevel;
    currentLevel = nextLevel;
    nextLevel = temp;
}
}

}
}

public class zigZagTreeTraversal {

public static void main(String[] args)
{
BinaryTree tree = new BinaryTree();
tree.rootNode = new Node(1);
tree.rootNode.leftChild = new Node(2);
tree.rootNode.rightChild = new Node(3);
tree.rootNode.leftChild.leftChild = new Node(7);
tree.rootNode.leftChild.rightChild = new Node(6);
tree.rootNode.rightChild.leftChild = new Node(5);
tree.rootNode.rightChild.rightChild = new Node(4);

System.out.println("ZigZag Order traversal of binary tree is");
tree.printZigZagTraversal();

}
}

[siriak]

We don't include interview questions