-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTree.java
More file actions
190 lines (172 loc) · 4.19 KB
/
Copy pathTree.java
File metadata and controls
190 lines (172 loc) · 4.19 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
/**
* @version 1.00 2018.7.17
* @author xiekun
*/
import java.util.ArrayList;
public class Tree{
private treeNode root;
private ArrayList<Integer> inorderList;
private ArrayList<Integer> preorderList;
private ArrayList<Integer> postorderList;
public Tree(){
this.root = null;
this.inorderList = new ArrayList<Integer>();
this.preorderList = new ArrayList<Integer>();
this.postorderList = new ArrayList<Integer>();
}
private void inorderTreeWalk(treeNode node){
if (node != null){
inorderTreeWalk(node.left);
inorderList.add(node.val);
inorderTreeWalk(node.right);
}
}
private void preorderTreeWalk(treeNode node){
if (node != null){
preorderList.add(node.val);
preorderTreeWalk(node.left);
preorderTreeWalk(node.right);
}
}
private void postorderTreeWalk(treeNode node){
if (node != null){
postorderTreeWalk(node.left);
postorderTreeWalk(node.right);
postorderList.add(node.val);
}
}
private void treeInsertWithWhile(Tree T, treeNode z){
treeNode y = null;
treeNode x = T.root;
while (x != null){
y = x;
if (z.val < x.val) x = x.left;
else x = x.right;
}
z.parent = y;
if (y == null) T.root = z;
else if (z.val < y.val) y.left = z;
else y.right = z;
}
private void treeInsert(Tree T, treeNode z){
if (T.root == null) T.root = z;
else T.treeInsert(T.root, z);
}
private void treeInsert(treeNode node, treeNode z){
if (z.val < node.val){
z.parent = node;
if (node.left != null) {
node = node.left;
treeInsert(node, z);
}
else node.left = z;
}
else{
z.parent = node;
if (node.right != null) {
node = node.right;
treeInsert(node, z);
}
else node.right = z;
}
}
private void buildTree(Tree T, int x){
treeNode node = new treeNode(x);
treeInsert(T, node);
}
private treeNode treeSearch(treeNode node, int k){
treeNode result = null;
if (node == null || k == node.val) result = node;
else if (k < node.val) result = treeSearch(node.left, k);
else result = treeSearch(node.right, k);
return result;
}
private treeNode treeSearchWithWhile(treeNode node, int k){
while (node != null && node.val != k){
if (k < node.val) node = node.left;
else node = node.right;
}
return node;
}
private treeNode treeMinimum(treeNode x){
while (x.left != null){
x = x.left;
}
return x;
}
private treeNode treeMaximum(treeNode x){
while (x.right != null){
x = x.right;
}
return x;
}
private treeNode nodeSuccessor(treeNode x){
if (x.right != null) return treeMinimum(x.right);
treeNode y = x.parent;
while (y != null && x == y.right){
x = y;
y = x.parent;
}
return y;
}
private treeNode nodePredecessor(treeNode x){
if (x.left != null) return treeMaximum(x.left);
treeNode y = x.parent;
while (y != null && x == y.left){
x = y;
y = x.parent;
}
return y;
}
private void transplant(Tree T, treeNode u, treeNode v){
if (u.parent == null) T.root = v;
else if (u == u.parent.left) u.parent.left = v;
else u.parent.right = v;
if (v != null) v.parent = u.parent;
}
private void treeDelete(Tree T, treeNode z){
if (z.left == null) transplant(T, z, z.right);
else if (z.right == null) transplant(T, z, z.left);
else{
treeNode y = treeMinimum(z.right);
if (y.parent != z){
transplant(T, y, y.right);
y.right = z.right;
z.right.parent = y;
}
transplant(T, z, y);
y.left = z.left;
z.left.parent = y;
}
}
public static void main(String[] args){
Tree T = new Tree();
int[] nums = {12, 5, 2, 9, 18, 15, 13, 17, 19};
for (int item:nums) {
T.buildTree(T, item);
}
T.inorderTreeWalk(T.root);
for (Integer item:T.inorderList){
System.out.println(item);
}
int aimKey = 9;
treeNode result = T.treeSearchWithWhile(T.root, aimKey);
treeNode predecessor = T.nodePredecessor(result);
T.treeDelete(T, predecessor);
T.inorderTreeWalk(T.root);
for (Integer item:T.inorderList){
System.out.println(item);
}
//System.out.println(predecessor.val);
//System.out.println(T.treeMaximum(T.root).val);
}
}
class treeNode{
int val;
treeNode left;
treeNode right;
treeNode parent;
public treeNode(int x) {
val = x;
}
}