-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathBinaryTree.java
More file actions
204 lines (190 loc) · 4.04 KB
/
BinaryTree.java
File metadata and controls
204 lines (190 loc) · 4.04 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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
package binarytree;
public class BinaryTree {
// 插入结点
public static void insertNode(Tree tree, int i) {
if (tree == null) {
return;
}
Node tNode = tree.root;
Node pNode = null;
Node nNode = new Node();
nNode.value = i;
while (tNode != null) {
pNode = tNode;
if (tNode.value <= i) {
tNode = tNode.right;
} else {
tNode = tNode.left;
}
}
if (pNode == null) {
tree.root = nNode;
} else if (pNode.value > i) {
pNode.left = nNode;
} else {
pNode.right = nNode;
}
tree.size++;
}
//新建树
public static Tree createTree(int[] is) {
Tree tree = new Tree();
tree.size = 0;
for (int i = 0; i < is.length; i++) {
insertNode(tree, is[i]);
}
return tree;
}
//删除结点
public static void deleteNode(Tree tree, int i) {
if (tree == null) {
return;
}
// Node pNode = findNode(tree, i);
// Node Node = findNode(tree, i);
Node fNode = tree.root;
Node pNode = tree.root;
while (pNode != null) {
if (pNode.value == i) {
break;
} else if (pNode.value > i) {
fNode = pNode;
pNode = pNode.left;
} else {
fNode = pNode;
pNode = pNode.right;
}
}
if (pNode.left == null && pNode.right == null) {
if (pNode == tree.root) {
tree = null;
} else {
pNode = null;
}
} else if (pNode.left == null) {
fNode.right = pNode.right;
} else if (pNode.right == null) {
fNode.left = pNode.left;
} else {
Node t = pNode;
Node s = pNode.left;
while (s.right != null) {
t = s;
s = s.right;
}
if (t == pNode) {
t.left = s.left;
} else {
t.right = s.left;
}
}
return;
}
//非递归先序遍历
public static void PrintPreOrder(Tree tree) {
if (tree == null) {
return;
}
Node[] stack = new Node[tree.size];
// System.out.println(tree.size);
int index = -1;
Node node = tree.root;
while (node != null || index >= 0) {
while (node != null) {
System.out.print(node.value + " ");
index++;
stack[index] = node;
node = node.left;
}
if (index >= 0) {
node = stack[index];
stack[index] = null;
index--;
}
node = node.right;
}
}
//非递归中序遍历
public static void PrintInorder(Tree tree) {
if (tree == null) {
return;
}
Node[] stack = new Node[tree.size];
Node node = tree.root;
int index = -1;
while (node != null || index >= 0) {
while (node != null) {
index++;
stack[index] = node;
node = node.left;
}
if (index >= 0) {
node = stack[index];
System.out.println(node.value);
stack[index] = null;
index--;
}
node = node.right;
}
}
//非递归后序遍历
public static void PrintPostorder(Tree tree) {
if (tree == null) {
return;
}
Node[] stack = new Node[tree.size];
Node node = tree.root;
Node preNode = null;
int index = 0;
stack[index] = node;
while (index >= 0) {
node = stack[index];
// 无子结点
boolean hasNoChild = node.left == null && node.right == null;
// 被访问
boolean NoVisit = preNode == node.left || preNode == node.right;
if (hasNoChild || NoVisit) {
System.out.println(node.value);
stack[index] = null;
index--;
preNode = node;
} else {
if (node.right != null) {
index++;
stack[index] = node.right;
}
if (node.left != null) {
index++;
stack[index] = node.left;
}
}
}
}
//递归先序遍历
public static void PrintPreorder(Node node) {
if (node == null) {
return;
}
System.out.println(node.value);
PrintInorder(node.left);
PrintInorder(node.right);
}
//递归中序遍历
public static void PrintInorder(Node node) {
if (node == null) {
return;
}
PrintInorder(node.left);
System.out.println(node.value);
PrintInorder(node.right);
}
//递归后序遍历
public static void PrintPostorder(Node node) {
if (node == null) {
return;
}
PrintInorder(node.left);
System.out.println(node.value);
PrintInorder(node.right);
}
}