Java 创建二叉搜索树
创建二叉搜索树
实例源码：
源代码：
执行
执行中...
x
1
2
class BinarySearchTree3
4
{5
6
node head;7
/*8
from 时 代 J a v a 公 众 号 9
*/10
11
12
static class node13
14
{15
16
int data;17
18
node left;19
20
node right;21
22
23
node(int d)24
25
{26
27
data = d;28
29
left = null;30
31
right = null;/**来自 NowJava.com - 时代Java**/32
33
}34
35
}36
37
38
public void Insert(int value)39
40
{41
42
node temp = new node(value);43
44
45
if(head == null)46
47
head = temp;48
49
else50
51
{52
53
node current;54
55
current = head;56
57
58
while(current != null)59
60
{61
62
if(value < current.data)63
64
{65
66
if(current.left != null)67
68
current = current.left;69
70
else71
72
{73
74
current.left = temp;75
76
return ;77
78
}79
80
}81
82
else83
84
{85
86
if(current.right != null)87
88
current = current.right;89
90
else91
92
{93
94
current.right = temp;95
96
return ;97
98
}99
100
}101
102
}103
104
}105
106
}107
108
109
public void Search(int value)110
111
{112
113
node current;114
115
current = head;116
117
118
while(current != null)119
120
{121
122
if(value < current.data)123
124
current = current.left;125
126
else if(value > current.data)127
128
current = current.right;129
130
else131
132
{133
134
System.out.println("Element " + value + " Found");135
136
return ;137
138
}139
140
}141
142
143
System.out.println("Element " + value + " not Found");144
145
}146
147
148
public int Min_Value(node head)149
150
{151
152
while(head.left != null)153
154
{155
156
head = head.left;157
158
}159
160
return head.data;161
162
}163
164
165
public node Delete_Key(node head, int value)166
167
{168
169
if(head == null)170
171
return head;172
173
174
if(value < head.data)175
176
head.left = Delete_Key(head.left, value);177
178
else if(value > head.data)179
180
head.right = Delete_Key(head.right, value);181
182
else183
184
{185
186
if(head.left == null)187
188
return head.right;189
190
else if(head.right == null)191
192
return head.left;193
194
195
head.data = Min_Value(head.right);196
197
head.right = Delete_Key(head.right, head.data);198
199
}200
201
202
return head;203
204
}205
206
207
public void Delete(int value)208
209
{210
211
head = Delete_Key(head, value);212
213
}214
215
216
/**代码未完, 请加载全部代码(NowJava.com).**/执行结果：
本文系作者在时代Java发表，未经许可，不得转载。如有侵权，请联系nowjava@qq.com删除。
编辑于
关注时代Java