-
Notifications
You must be signed in to change notification settings - Fork 2
/
BBinarySearchTree.java
98 lines (87 loc) · 1.79 KB
/
BBinarySearchTree.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
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
package will.zhang.binarySearchTree;
/**
* @Author will
* @Date 2018/5/16 0016 下午 6:32
**/
public class BBinarySearchTree<E extends Comparable<E>> {
/**
* 节点
* 二分搜索树的私有类
* 对用户屏蔽, 用户无需知道
*/
private class Node{
//存放数据
public E e;
//左节点和右节点
public Node left, right;
public Node(E e){
this.e = e;
left = null;
right = null;
}
}
/**
* 根节点
*/
private Node root;
/**
* 数的大小
*/
private int size;
/**
* 默认构造函数
*/
public BBinarySearchTree(){
root = null;
size = 0;
}
/**
* 二分搜索树的大小
* @return
*/
public int size(){
return size;
}
/**
* 树是否为空
* @return
*/
public boolean isEmpty(){
return size == 0;
}
/**
* 为二分搜索数添加元素
* @param e
*/
public void add(E e){
if(root == null){
root = new Node(e);
size++;
}else{
add(root, e);
}
}
/**
* 以node为根的二分搜索树插入元素e
* @param node
* @param e
*/
private void add(Node node, E e){
if(e.equals(node.e)){
return;
}else if(e.compareTo(node.e) < 0 && node.left == null){
node.left = new Node(e);
size++;
return;
}else if(e.compareTo(node.e) > 0 && node.right == null){
node.right = new Node(e);
size++;
return;
}
if(e.compareTo(node.e) < 0){
add(node.left, e);
}else{
add(node.right, e);
}
}
}