-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathMorris.java
More file actions
168 lines (146 loc) · 4.64 KB
/
Copy pathMorris.java
File metadata and controls
168 lines (146 loc) · 4.64 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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
package algorithm.advanced01;
import algorithm.basic04.Code_01_PreInPosTraversal;
/**
* @author mood321
* @date 2019/11/25 20:23
* @email [email protected]
* @desc 二叉树的morris遍历
*/
public class Morris {
public static class Node {
Integer data;
Node left;
Node right;
public Node(Integer value) {
data = value;
}
}
public static void morrispre(Node head) {
if (head == null) {
return;
}
Node cur = head;
Node morrRight = null;
while (cur != null) {
morrRight = cur.left;
if (morrRight != null) {
// 左子树不为null 拿到最右叶子节点
// 叶子节点的右等于null 第一次来 不等第二次来到这个节点
while (morrRight.right != null && morrRight.right != cur){
morrRight= morrRight.right;
}
if(morrRight.right==null){ // 第一次
System.out.println(cur.data);
morrRight.right=cur;
cur=cur.left;
} else { //第二次
cur=cur .right;
morrRight.right=null;
}
} else {
// 左子树为 输出cur 来到右
System.out.println(cur.data);
cur = cur.right;
}
}
} public static void morrisin(Node head) {
if (head == null) {
return;
}
Node cur = head;
Node morrRight = null;
while (cur != null) {
morrRight = cur.left;
if (morrRight != null) {
// 左子树不为null 拿到最右叶子节点
// 叶子节点的右等于null 第一次来 不等第二次来到这个节点
while (morrRight.right != null && morrRight.right != cur){
morrRight= morrRight.right;
}
if(morrRight.right==null){ // 第一次
morrRight.right=cur;
cur=cur.left;
} else { //第二次
System.out.println(cur.data);
cur=cur .right;
morrRight.right=null;
}
} else {
// 左子树为 输出cur 来到右
System.out.println(cur.data);
cur = cur.right;
}
}
}
public static void morrispos(Node head) {
if (head == null) {
return;
}
Node cur1 = head;
Node cur2 = null;
while (cur1 != null) {
cur2 = cur1.left;
if (cur2 != null) {
while (cur2.right != null && cur2.right != cur1) {
cur2 = cur2.right;
}
if (cur2.right == null) {
cur2.right = cur1;
cur1 = cur1.left;
continue;
} else {
cur2.right = null;
printEdge(cur1.left);
}
}
cur1 = cur1.right;
}
printEdge(head);
System.out.println();
}
public static void printEdge(Node head) {
Node tail = reverseEdge(head);
Node cur = tail;
while (cur != null) {
System.out.print(cur.data + " ");
cur = cur.right;
}
reverseEdge(tail);
}
public static Node reverseEdge(Node from) {
Node pre = null;
Node next = null;
while (from != null) {
next = from.right;
from.right = pre;
pre = from;
from = next;
}
return pre;
}
public static void main(String[] args) {
Node head = new Node(5);
head.left = new Node(3);
head.right = new Node(8);
head.left.left = new Node(2);
head.left.right = new Node(4);
head.left.left.left = new Node(1);
head.right.left = new Node(7);
head.right.left.left = new Node(6);
head.right.right = new Node(10);
head.right.right.left = new Node(9);
head.right.right.right = new Node(11);
// recursive
System.out.println("==============recursive==============");
System.out.print("pre-order: ");
morrispre(head);
System.out.println();
System.out.print("in-order: ");
morrisin(head);
System.out.println();
System.out.print("pos-order: ");
morrispos(head);
System.out.println();
// 前两种在基础04 里面
}
}