-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinarySearchTree.java
66 lines (47 loc) · 1.1 KB
/
BinarySearchTree.java
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
/**
* Implementation of BinarySearchTree using arrays.
*/
public class BinarySearchTree<E extends Comparable<E>> {
E[] nodes;
@SuppressWarnings("unchecked")
public BinarySearchTree() {
nodes = (E[])new Object[10];
nodes[0] = null;
}
public BinarySearchTree(E obj) {
this();
nodes[1] = obj;
}
// TODO
@SuppressWarnings("unchecked")
public BinarySearchTree(E[] arr) {
this();
}
@SuppressWarnings("unchecked")
public void empty() {
nodes = (E[])new Object[10];
nodes[0] = null;
}
public int size() {
int count = 0;
for(int i = 1; i < nodes.length; i++) {
if(nodes[i] != null) count++;
}
return count;
}
public void add(E obj) {
if(nodes[1] == null) {
nodes[1] = obj;
}
else addHelper(obj, 1);
}
private void addHelper(E obj, int index) {
if(nodes[index] == null) nodes[index] = obj;
else if(nodes[index].compareTo(obj) > 1) {
addHelper(obj, index * 2);
}
else if(nodes[index].compareTo(obj) <= 0) {
addHelper(obj, index * 2);
}
}
}