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
|
package bjc.utils.funcdata.bst;
import static bjc.utils.funcdata.bst.DirectedWalkFunction.DirectedWalkResult.*;
import java.util.Comparator;
import java.util.function.BiFunction;
import java.util.function.Function;
import java.util.function.Predicate;
/**
* A binary node in a tree.
*
* @author ben
*
* @param <T>
* The data type stored in the tree.
*/
public class BinarySearchTreeNode<T> extends BinarySearchTreeLeaf<T> {
/**
* The left child of this node
*/
private ITreePart<T> left;
/**
* The right child of this node
*/
private ITreePart<T> right;
/**
* Create a new node with the specified data and children.
*
* @param data
* The data to store in this node.
* @param left
* The left child of this node.
* @param right
* The right child of this node.
*/
public BinarySearchTreeNode(T data, ITreePart<T> left,
ITreePart<T> right) {
super(data);
this.left = left;
this.right = right;
}
/*
* Either adds it to the left/right, or undeletes itself. (non-Javadoc)
*
* @see bjc.utils.data.bst.TreeLeaf#add(java.lang.Object,
* java.util.Comparator)
*/
@Override
public void add(T dat, Comparator<T> comp) {
switch (comp.compare(data, dat)) {
case -1:
if (left == null) {
left = new BinarySearchTreeNode<>(dat, null, null);
} else {
left.add(dat, comp);
}
case 0:
if (deleted) {
deleted = false;
} else {
throw new IllegalArgumentException(
"Can't add duplicate values");
}
case 1:
if (right == null) {
right = new BinarySearchTreeNode<>(dat, null, null);
} else {
right.add(dat, comp);
}
}
}
@Override
public <E> E collapse(Function<T, E> f, BiFunction<E, E, E> bf) {
E tm = f.apply(data);
if (left != null) {
if (right != null) {
return bf.apply(tm, bf.apply(left.collapse(f, bf),
right.collapse(f, bf)));
} else {
return bf.apply(tm, left.collapse(f, bf));
}
} else {
if (right != null) {
return bf.apply(tm, right.collapse(f, bf));
} else {
return tm;
}
}
}
@Override
public boolean contains(T dat, Comparator<T> cmp) {
return directedWalk(ds -> {
switch (cmp.compare(dat, ds)) {
case -1:
return LEFT;
case 0:
return deleted ? FAILURE : SUCCESS;
case 1:
return RIGHT;
default:
return FAILURE;
}
});
}
@Override
public void delete(T dat, Comparator<T> cmp) {
directedWalk(ds -> {
switch (cmp.compare(data, dat)) {
case -1:
return left == null ? FAILURE : LEFT;
case 0:
deleted = true;
return FAILURE;
case 1:
return right == null ? FAILURE : RIGHT;
default:
return FAILURE;
}
});
}
@Override
public boolean directedWalk(DirectedWalkFunction<T> ds) {
switch (ds.walk(data)) {
case SUCCESS:
return true;
case LEFT:
return left.directedWalk(ds);
case RIGHT:
return right.directedWalk(ds);
case FAILURE:
return false;
default:
return false;
}
}
@Override
public boolean forEach(TreeLinearizationMethod tlm, Predicate<T> c) {
switch (tlm) {
case PREORDER:
return preorderTraverse(tlm, c);
case INORDER:
return inorderTraverse(tlm, c);
case POSTORDER:
return postorderTraverse(tlm, c);
default:
throw new IllegalArgumentException(
"Passed an incorrect TreeLinearizationMethod.");
}
}
private boolean inorderTraverse(TreeLinearizationMethod tlm,
Predicate<T> c) {
return ((left == null ? true : left.forEach(tlm, c))
&& (deleted ? true : c.test(data))
&& (right == null ? true : right.forEach(tlm, c)));
}
private boolean postorderTraverse(TreeLinearizationMethod tlm,
Predicate<T> c) {
return ((left == null ? true : left.forEach(tlm, c))
&& (right == null ? true : right.forEach(tlm, c))
&& (deleted ? true : c.test(data)));
}
private boolean preorderTraverse(TreeLinearizationMethod tlm,
Predicate<T> c) {
return ((deleted ? true : c.test(data))
&& (left == null ? true : left.forEach(tlm, c))
&& (right == null ? true : right.forEach(tlm, c)));
}
}
|
