FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/DataStructures/Trees/BSTRecursive.java at master · loisoft/Java · GitHub
loisoft
/
Java
Public
forked from
TheAlgorithms/Java
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java
/
DataStructures
/
Trees
/
BSTRecursive.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
242 lines (226 loc) · 6.3 KB
Breadcrumbs
Java
/
DataStructures
/
Trees
/
BSTRecursive.java
Copy path
File metadata and controls
242 lines (226 loc) · 6.3 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
/**
*
*
* <h1>Binary Search Tree (Recursive)</h1>
*
* An implementation of BST recursively. In recursive implementation the checks are down the tree
* First root is checked if not found then its childs are checked Binary Search Tree is a binary
* tree which satisfies three properties: left child is less than root node, right child is grater
* than root node, both left and right childs must themselves be a BST.
*
* <p>I have made public functions as methods and to actually implement recursive approach I have
* used private methods
*
* @author [Lakhan Nad](https://github.com/Lakhan-Nad)
*/
public
class
BSTRecursive
{
/** only data member is root of BST */
private
Node
root
;
/** Constructor use to initialize node as null */
BSTRecursive
() {
root
=
null
;
}
/** main function for tests */
public
static
void
main
(
String
[]
args
) {
BSTIterative
tree
=
new
BSTIterative
();
tree
.
add
(
5
);
tree
.
add
(
10
);
tree
.
add
(
9
);
assert
!
tree
.
find
(
4
) :
"4 is not yet present in BST"
;
assert
tree
.
find
(
10
) :
"10 should be present in BST"
;
tree
.
remove
(
9
);
assert
!
tree
.
find
(
9
) :
"9 was just deleted from BST"
;
tree
.
remove
(
1
);
assert
!
tree
.
find
(
1
) :
"Since 1 was not present so find deleting would do no change"
;
tree
.
add
(
20
);
tree
.
add
(
70
);
assert
tree
.
find
(
70
) :
"70 was inserted but not found"
;
/*
Will print in following order
5 10 20 70
*/
tree
.
inorder
();
}
/**
* Recursive method to delete a data if present in BST.
*
* @param node the current node to search for data
* @param data the value to be deleted
* @return Node the updated value of root parameter after delete operation
*/
private
Node
delete
(
Node
node
,
int
data
) {
if
(
node
==
null
) {
System
.
out
.
println
(
"No such data present in BST."
);
}
else
if
(
node
.
data
>
data
) {
node
.
left
=
delete
(
node
.
left
,
data
);
}
else
if
(
node
.
data
<
data
) {
node
.
right
=
delete
(
node
.
right
,
data
);
}
else
{
if
(
node
.
right
==
null
&&
node
.
left
==
null
) {
// If it is leaf node
node
=
null
;
}
else
if
(
node
.
left
==
null
) {
// If only right node is present
Node
temp
=
node
.
right
;
node
.
right
=
null
;
node
=
temp
;
}
else
if
(
node
.
right
==
null
) {
// Only left node is present
Node
temp
=
node
.
left
;
node
.
left
=
null
;
node
=
temp
;
}
else
{
// both child are present
Node
temp
=
node
.
right
;
// Find leftmost child of right subtree
while
(
temp
.
left
!=
null
) {
temp
=
temp
.
left
;
}
node
.
data
=
temp
.
data
;
node
.
right
=
delete
(
node
.
right
,
temp
.
data
);
}
}
return
node
;
}
/**
* Recursive insertion of value in BST.
*
* @param node to check if the data can be inserted in current node or its subtree
* @param data the value to be inserted
* @return the modified value of the root parameter after insertion
*/
private
Node
insert
(
Node
node
,
int
data
) {
if
(
node
==
null
) {
node
=
new
Node
(
data
);
}
else
if
(
node
.
data
>
data
) {
node
.
left
=
insert
(
node
.
left
,
data
);
}
else
if
(
node
.
data
<
data
) {
node
.
right
=
insert
(
node
.
right
,
data
);
}
return
node
;
}
/**
* Recursively print Preorder traversal of the BST
*
* @param node the root node
*/
private
void
preOrder
(
Node
node
) {
if
(
node
==
null
) {
return
;
}
System
.
out
.
print
(
node
.
data
+
" "
);
if
(
node
.
left
!=
null
) {
preOrder
(
node
.
left
);
}
if
(
node
.
right
!=
null
) {
preOrder
(
node
.
right
);
}
}
/**
* Recursively print Postorder travesal of BST.
*
* @param node the root node
*/
private
void
postOrder
(
Node
node
) {
if
(
node
==
null
) {
return
;
}
if
(
node
.
left
!=
null
) {
postOrder
(
node
.
left
);
}
if
(
node
.
right
!=
null
) {
postOrder
(
node
.
right
);
}
System
.
out
.
print
(
node
.
data
+
" "
);
}
/**
* Recursively print Inorder traversal of BST.
*
* @param node the root node
*/
private
void
inOrder
(
Node
node
) {
if
(
node
==
null
) {
return
;
}
if
(
node
.
left
!=
null
) {
inOrder
(
node
.
left
);
}
System
.
out
.
print
(
node
.
data
+
" "
);
if
(
node
.
right
!=
null
) {
inOrder
(
node
.
right
);
}
}
/**
* Serach recursively if the given value is present in BST or not.
*
* @param node the current node to check
* @param data the value to be checked
* @return boolean if data is present or not
*/
private
boolean
search
(
Node
node
,
int
data
) {
if
(
node
==
null
) {
return
false
;
}
else
if
(
node
.
data
==
data
) {
return
true
;
}
else
if
(
node
.
data
>
data
) {
return
search
(
node
.
left
,
data
);
}
else
{
return
search
(
node
.
right
,
data
);
}
}
/**
* add in BST. if the value is not already present it is inserted or else no change takes place.
*
* @param data the value to be inserted
*/
public
void
add
(
int
data
) {
this
.
root
=
insert
(
this
.
root
,
data
);
}
/**
* If data is present in BST delete it else do nothing.
*
* @param data the value to be removed
*/
public
void
remove
(
int
data
) {
this
.
root
=
delete
(
this
.
root
,
data
);
}
/** To call inorder traversal on tree */
public
void
inorder
() {
System
.
out
.
println
(
"Inorder traversal of this tree is:"
);
inOrder
(
this
.
root
);
System
.
out
.
println
();
// for next line
}
/** To call postorder traversal on tree */
public
void
postorder
() {
System
.
out
.
println
(
"Postorder traversal of this tree is:"
);
postOrder
(
this
.
root
);
System
.
out
.
println
();
// for next li
}
/** To call preorder traversal on tree. */
public
void
preorder
() {
System
.
out
.
println
(
"Preorder traversal of this tree is:"
);
preOrder
(
this
.
root
);
System
.
out
.
println
();
// for next li
}
/**
* To check if given value is present in tree or not.
*
* @param data the data to be found for
*/
public
boolean
find
(
int
data
) {
if
(
search
(
this
.
root
,
data
)) {
System
.
out
.
println
(
data
+
" is present in given BST."
);
return
true
;
}
System
.
out
.
println
(
data
+
" not found."
);
return
false
;
}
/** The Node class used for building binary search tree */
private
static
class
Node
{
int
data
;
Node
left
;
Node
right
;
/** Constructor with data as parameter */
Node
(
int
d
) {
data
=
d
;
left
=
null
;
right
=
null
;
}
}
}
Back
|
FazBrowse Home
|
New Git URL