Repository navigation
Expand file tree
/
Copy pathBinarySearchTree.java
More file actions
170 lines (151 loc) · 3.64 KB
/
Copy pathBinarySearchTree.java
File metadata and controls
170 lines (151 loc) · 3.64 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
package sort;
import java.util.*;
public class BinarySearchTree {
public static void main(String[] args) {
BinarySearchTree bst = new BinarySearchTree();
bst.add(10);
bst.add(20);
bst.add(5);
bst.add(6);
bst.add(21);
bst.add(16);
bst.delete(bst.getRoot(),10);
if(!bst.search(10))
System.out.println("not find 10");
bst.printTree(bst.root);
}
public void printTree(Node current){
System.out.println(current.getData());
if(current.getLeftChild() != null)
printTree(current.getLeftChild());
if(current.getRightChild() != null)
printTree(current.getRightChild());
}
Node root;
BinarySearchTree(){
this.root = null;
}
public boolean search(int data) {
Node temp = root;
while(true) {
if(temp == null)
return false;
if(temp.getData() == data) {
return true;
}
else if(temp.getData() > data) {
temp = temp.getLeftChild();
}
else {
temp = temp.getRightChild();
}
}
}
public Node getNode(Node node, int data) {
Node temp = node;
while(true) {
if(temp == null)
return null;
if(temp.getData() == data) {
return temp;
}
else if(temp.getData() > data) {
temp = temp.getLeftChild();
}
else {
temp = temp.getRightChild();
}
}
}
public boolean add(int data) {
Node node = new Node();
node.setData(data);
node.setLeftChild(null);
node.setRightChild(null);
if(root == null) {
root = node;
return true;
}
Node temp = root;
while(true) {
if(temp.getData() == node.getData())
return false;
else if(temp.getData() < node.getData()) {
if(temp.getRightChild() == null) {
node.setParent(temp);
temp.setRightChild(node);
return true;
}
else {
temp = temp.getRightChild();
continue;
}
}
else {
if(temp.getData() > node.getData()) {
if(temp.getLeftChild() == null) {
node.setParent(temp);
temp.setLeftChild(node);
return true;
}
else {
temp = temp.getLeftChild();
continue;
}
}
}
}
}
public Node findMin(Node node){
if(node == null)
return null;
if(node.getLeftChild() != null) return findMin(node.getLeftChild());
else return node;
}
public void delete(Node node, int data) {
System.out.println("start delete : " + data);
Node remove = getNode(node, data);
if(remove==null){
System.out.println("no data");
return;
}
System.out.println("find");
if(remove.getRightChild()==null && remove.getLeftChild()==null){
if(remove.getParent().getLeftChild() == remove)
remove.getParent().setLeftChild(null);
else
remove.getParent().setRightChild(null);
System.out.println("delete");
return;
}
if(remove.getLeftChild() !=null && remove.getRightChild()!=null){
Node temp = findMin(remove.getRightChild());
int remove_data = remove.getData();
remove.setData(temp.getData());
temp.setData(remove_data);
delete(remove.getRightChild(), remove_data);
return;
}
else {
if(remove.getLeftChild() !=null){
if(remove.getParent().getLeftChild() == remove){
remove.getParent().setLeftChild(remove.getLeftChild());
}
else{
remove.getParent().setRightChild(remove.getLeftChild());
}
}
else{
if(remove.getParent().getLeftChild() == remove){
remove.getParent().setLeftChild(remove.getRightChild());
}
else{
remove.getParent().setRightChild(remove.getRightChild());
}
}
System.out.println("delete");
return;
}
}
public Node getRoot(){return this.root;}
}