-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathMorris_Traversal.java
More file actions
60 lines (50 loc) · 1.62 KB
/
Copy pathMorris_Traversal.java
File metadata and controls
60 lines (50 loc) · 1.62 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
package trees.binaryTree;
// import java.util.*;
public class Morris_Traversal {
// Find Level order traversal of binary tree
static class Node {
int data;
int hd;
Node left, right;
public Node(int item) {
data = item;
hd = Integer.MAX_VALUE;
left = right = null;
}
}
static Node root;
public static void printMorrisTraversal(Node root) {
// Queue<Node> tq = new LinkedList<>();
Node curr, prev;
if (root == null)
return;
curr = root;
while (curr != null) {
if (curr.left == null) {
System.out.println(curr.data);
curr = curr.right;
} else {
prev = curr.left;
while (prev.right != null && prev.right != curr)
prev = prev.right;
if (prev.right == null) {
prev.right = curr;
curr = curr.left;
} else {
prev.right = null;
System.out.println(curr.data + " ");
curr = curr.right;
}
}
}
}
public static void main(String[] args) {
// Morris_Traversal tree = new Morris_Traversal();
Morris_Traversal.root = new Node(1);
Morris_Traversal.root.left = new Node(2);
Morris_Traversal.root.right = new Node(3);
Morris_Traversal.root.left.left = new Node(4);
Morris_Traversal.root.left.right = new Node(5);
Morris_Traversal.printMorrisTraversal(Morris_Traversal.root);
}
}