-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathZigZagTree.java
More file actions
91 lines (72 loc) · 2.42 KB
/
Copy pathZigZagTree.java
File metadata and controls
91 lines (72 loc) · 2.42 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
package LinkedList;
import java.util.Stack;
/**
* Created by rmukherj on 8/11/16.
*/
public class ZigZagTree {
// prints in Spiral/Zigzag level order
public static class TreeNode {
int data;
TreeNode left;
TreeNode right;
TreeNode(int data) {
this.data = data;
}
}
// prints spiral/zigzag level order
public static void spiralOrZigzagLevelOrder(TreeNode root) {
if (root == null) return;
Stack<TreeNode> stack = new Stack<TreeNode>();
stack.push(root);
boolean directionflag = false;
while (!stack.isEmpty()) {
Stack<TreeNode> tempStack = new Stack<TreeNode>();
while (!stack.isEmpty()) {
TreeNode tempNode = stack.pop();
System.out.printf("%d ", tempNode.data);
if (!directionflag) {
if (tempNode.left != null)
tempStack.push(tempNode.left);
if (tempNode.right != null)
tempStack.push(tempNode.right);
} else {
if (tempNode.right != null)
tempStack.push(tempNode.right);
if (tempNode.left != null)
tempStack.push(tempNode.left);
}
}
// for changing direction
directionflag = !directionflag;
stack = tempStack;
}
}
public static TreeNode createBinaryTree()
{
TreeNode rootNode =new TreeNode(40);
TreeNode node20=new TreeNode(20);
TreeNode node10=new TreeNode(10);
TreeNode node30=new TreeNode(30);
TreeNode node60=new TreeNode(60);
TreeNode node50=new TreeNode(50);
TreeNode node70=new TreeNode(70);
TreeNode node5=new TreeNode(5);
TreeNode node55=new TreeNode(55);
rootNode.left=node20;
rootNode.right=node60;
node20.left=node10;
node20.right=node30;
node60.left=node50;
node60.right=node70;
node10.left=node5;
node50.right=node55;
return rootNode;
}
public static void main(String[] args) {
ZigZagTree bi=new ZigZagTree();
// Creating a binary tree
TreeNode rootNode=createBinaryTree();
System.out.println("Spiral/Zigzag traversal of binary tree :");
spiralOrZigzagLevelOrder(rootNode);
}
}