Data-Structures/BinarySearchTree.java at master · mchao409/Data-Structures · GitHub

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.
 */

publicclassBinarySearchTree<EextendsComparable<E>> {
E[] nodes;

@SuppressWarnings("unchecked")
publicBinarySearchTree() {
nodes = (E[])newObject[10];
nodes[0] = null;
 }

publicBinarySearchTree(Eobj) {
this();
nodes[1] = obj;
 }

// TODO
@SuppressWarnings("unchecked")
publicBinarySearchTree(E[] arr) {
this();

 }

@SuppressWarnings("unchecked")
publicvoidempty() {
nodes = (E[])newObject[10];
nodes[0] = null;
 }

publicintsize() {
intcount = 0;
for(inti = 1; i < nodes.length; i++) {
if(nodes[i] != null) count++;
 }
returncount;
 }


publicvoidadd(Eobj) {
if(nodes[1] == null) {
nodes[1] = obj;
 }
elseaddHelper(obj, 1);
 }

privatevoidaddHelper(Eobj, intindex) {
if(nodes[index] == null) nodes[index] = obj;
elseif(nodes[index].compareTo(obj) > 1) {
addHelper(obj, index * 2);
 }
elseif(nodes[index].compareTo(obj) <= 0) {
addHelper(obj, index * 2);
 }

 }


}