FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/DataStructures/Trees/BSTIterative.java at master · dsfb/Java · GitHub
dsfb
/
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
/
BSTIterative.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
287 lines (276 loc) · 7.7 KB
Breadcrumbs
Java
/
DataStructures
/
Trees
/
BSTIterative.java
Copy path
File metadata and controls
287 lines (276 loc) · 7.7 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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
/**
*
*
* <h1>Binary Search Tree (Iterative)</h1>
*
* <p>An implementation of BST iteratively. 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.
*
* @author [Lakhan Nad](https://github.com/Lakhan-Nad)
*/
import
java
.
util
.
Stack
;
public
class
BSTIterative
{
/** Reference for the node of BST. */
private
Node
root
;
/** Default Constructor Initializes the root of BST with null. */
BSTIterative
() {
root
=
null
;
}
/** main function for tests */
public
static
void
main
(
String
[]
args
) {
BSTIterative
tree
=
new
BSTIterative
();
tree
.
add
(
3
);
tree
.
add
(
2
);
tree
.
add
(
9
);
assert
!
tree
.
find
(
4
) :
"4 is not yet present in BST"
;
assert
tree
.
find
(
2
) :
"2 should be present in BST"
;
tree
.
remove
(
2
);
assert
!
tree
.
find
(
2
) :
"2 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
(
30
);
tree
.
add
(
40
);
assert
tree
.
find
(
40
) :
"40 was inserted but not found"
;
/*
Will print following order
3 9 30 40
*/
tree
.
inorder
();
}
/**
* A method to insert a new value in BST. If the given value is already present in BST the
* insertion is ignored.
*
* @param data the value to be inserted
*/
public
void
add
(
int
data
) {
Node
parent
=
null
;
Node
temp
=
this
.
root
;
int
rightOrLeft
= -
1
;
/* Finds the proper place this node can
* be placed in according to rules of BST.
*/
while
(
temp
!=
null
) {
if
(
temp
.
data
>
data
) {
parent
=
temp
;
temp
=
parent
.
left
;
rightOrLeft
=
0
;
}
else
if
(
temp
.
data
<
data
) {
parent
=
temp
;
temp
=
parent
.
right
;
rightOrLeft
=
1
;
}
else
{
System
.
out
.
println
(
data
+
" is already present in BST."
);
return
;
// if data already present we ignore insertion
}
}
/* Creates a newNode with the value passed
* Since this data doesn't already exists
*/
Node
newNode
=
new
Node
(
data
);
/* If the parent node is null
* then the insertion is to be done in
* root itself.
*/
if
(
parent
==
null
) {
this
.
root
=
newNode
;
}
else
{
/* Check if insertion is to be made in
* left or right subtree.
*/
if
(
rightOrLeft
==
0
) {
parent
.
left
=
newNode
;
}
else
{
parent
.
right
=
newNode
;
}
}
}
/**
* A method to delete the node in BST. If node is present it will be deleted
*
* @param data the value that needs to be deleted
*/
public
void
remove
(
int
data
) {
Node
parent
=
null
;
Node
temp
=
this
.
root
;
int
rightOrLeft
= -
1
;
/* Find the parent of the node and node itself
* That is to be deleted.
* parent variable store parent
* temp stores node itself.
* rightOrLeft use to keep track weather child
* is left or right subtree
*/
while
(
temp
!=
null
) {
if
(
temp
.
data
==
data
) {
break
;
}
else
if
(
temp
.
data
>
data
) {
parent
=
temp
;
temp
=
parent
.
left
;
rightOrLeft
=
0
;
}
else
{
parent
=
temp
;
temp
=
parent
.
right
;
rightOrLeft
=
1
;
}
}
/* If temp is null than node with given value is not
* present in our tree.
*/
if
(
temp
!=
null
) {
Node
replacement
;
// used to store the new values for replacing nodes
if
(
temp
.
right
==
null
&&
temp
.
left
==
null
) {
// Leaf node Case
replacement
=
null
;
}
else
if
(
temp
.
right
==
null
) {
// Node with only right child
replacement
=
temp
.
left
;
temp
.
left
=
null
;
}
else
if
(
temp
.
left
==
null
) {
// Node with only left child
replacement
=
temp
.
right
;
temp
.
right
=
null
;
}
else
{
/* If both left and right child are present
* we replace this nodes data with
* leftmost node's data in its right subtree
* to maintain the balance of BST.
* And then delete that node
*/
if
(
temp
.
right
.
left
==
null
) {
temp
.
data
=
temp
.
right
.
data
;
replacement
=
temp
;
temp
.
right
=
temp
.
right
.
right
;
}
else
{
Node
parent2
=
temp
.
right
;
Node
child
=
temp
.
right
.
left
;
while
(
child
.
left
!=
null
) {
parent2
=
child
;
child
=
parent2
.
left
;
}
temp
.
data
=
child
.
data
;
parent2
.
left
=
child
.
right
;
replacement
=
temp
;
}
}
/* Change references of parent after
* deleting the child.
*/
if
(
parent
==
null
) {
this
.
root
=
replacement
;
}
else
{
if
(
rightOrLeft
==
0
) {
parent
.
left
=
replacement
;
}
else
{
parent
.
right
=
replacement
;
}
}
}
}
/** A method for inorder traversal of BST. */
public
void
inorder
() {
if
(
this
.
root
==
null
) {
System
.
out
.
println
(
"This BST is empty."
);
return
;
}
System
.
out
.
println
(
"Inorder traversal of this tree is:"
);
Stack
<
Node
>
st
=
new
Stack
<
Node
>();
Node
cur
=
this
.
root
;
while
(
cur
!=
null
|| !
st
.
empty
()) {
while
(
cur
!=
null
) {
st
.
push
(
cur
);
cur
=
cur
.
left
;
}
cur
=
st
.
pop
();
System
.
out
.
print
(
cur
.
data
+
" "
);
cur
=
cur
.
right
;
}
System
.
out
.
println
();
// for next line
}
/** A method used to print postorder traversal of BST. */
public
void
postorder
() {
if
(
this
.
root
==
null
) {
System
.
out
.
println
(
"This BST is empty."
);
return
;
}
System
.
out
.
println
(
"Postorder traversal of this tree is:"
);
Stack
<
Node
>
st
=
new
Stack
<
Node
>();
Node
cur
=
this
.
root
,
temp2
;
while
(
cur
!=
null
|| !
st
.
empty
()) {
if
(
cur
!=
null
) {
st
.
push
(
cur
);
cur
=
cur
.
left
;
}
else
{
temp2
=
st
.
peek
();
if
(
temp2
.
right
!=
null
) {
cur
=
temp2
.
right
;
}
else
{
st
.
pop
();
while
(!
st
.
empty
() &&
st
.
peek
().
right
==
temp2
) {
System
.
out
.
print
(
temp2
.
data
+
" "
);
temp2
=
st
.
pop
();
}
System
.
out
.
print
(
temp2
.
data
+
" "
);
}
}
}
System
.
out
.
println
();
// for next line
}
/** Method used to display preorder traversal of BST. */
public
void
preorder
() {
if
(
this
.
root
==
null
) {
System
.
out
.
println
(
"This BST is empty."
);
return
;
}
System
.
out
.
println
(
"Preorder traversal of this tree is:"
);
Stack
<
Node
>
st
=
new
Stack
<
Node
>();
st
.
push
(
this
.
root
);
Node
temp
;
while
(!
st
.
empty
()) {
temp
=
st
.
pop
();
System
.
out
.
print
(
temp
.
data
+
" "
);
if
(
temp
.
right
!=
null
) {
st
.
push
(
temp
.
right
);
}
if
(
temp
.
left
!=
null
) {
st
.
push
(
temp
.
left
);
}
}
System
.
out
.
println
();
// for next line
}
/**
* A method to check if given data exists in out Binary Search Tree.
*
* @param data the value that needs to be searched for
* @return boolean representing if the value was find
*/
public
boolean
find
(
int
data
) {
Node
temp
=
this
.
root
;
/* Check if node exists
*/
while
(
temp
!=
null
) {
if
(
temp
.
data
>
data
) {
temp
=
temp
.
left
;
}
else
if
(
temp
.
data
<
data
) {
temp
=
temp
.
right
;
}
else
{
/* If found return true
*/
System
.
out
.
println
(
data
+
" is present in the 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