-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathBT_Problem_13.java
More file actions
77 lines (58 loc) · 1.47 KB
/
Copy pathBT_Problem_13.java
File metadata and controls
77 lines (58 loc) · 1.47 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
package trees.binaryTree;
import java.util.*;
/*
* Problem Title :- Zig-Zag traversal of a binary tree
*/
class BinaryTree{
Node root;
void printZigZagTraversal() {
if(root == null)
return;
Stack<Node> currentLevel = new Stack<>();
Stack<Node> nextLevel = new Stack<>();
currentLevel.push(root);
boolean leftToRight = true;;
while(!currentLevel.isEmpty()) {
Node node = currentLevel.pop();
System.out.print(node.data + " ");
if(leftToRight) {
if(node.left != null) {
nextLevel.push(node.left);
}
if(node.left != null) {
nextLevel.push(node.left);
}
}
else {
if(node.right != null) {
nextLevel.push(node.right);
}
if(node.left != null) {
nextLevel.push(node.left);
}
}
if(currentLevel.isEmpty()) {
leftToRight = !leftToRight;
Stack<Node> temp = currentLevel;
currentLevel = nextLevel;
nextLevel = temp;
}
}
}
}
public class BT_Problem_13 {
public static void main(String[] args) {
BinaryTree tree = new BinaryTree();
tree.root = new Node(1);
tree.root.left = new Node(8);
tree.root.right = new Node(21);
tree.root.left.left = new Node(2);
tree.root.left.right = new Node(3);
tree.root.right.left = new Node(7);
tree.root.right.right = new Node(6);
tree.root.left.right.left = new Node(5);
tree.root.left.right.right = new Node(4);
System.out.println("ZigZag Order traversal tree is ");
tree.printZigZagTraversal();
}
}