Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Closest Binary Search Tree Value
Bookmark
Inorder Brute Force
BST Iterative
BST Recursive
Input
Standard
Between Nodes
Single Path
Custom
tree
=
[4, 2, 5, 1, 3]
,
target
=
3.7
4
2
5
1
3
values
empty
Target:
3.7
Closest:
-
Diff:
-
4
2
5
1
3
values
empty
Target:
3.7
Closest:
-
Diff:
-
4
2
5
1
3
node
values
empty
Target:
3.7
Closest:
-
Diff:
-
4
2
5
1
3
node
values
1
Target:
3.7
Closest:
-
Diff:
-
4
2
5
1
3
node
values
1
2
Target:
3.7
Closest:
-
Diff:
-
4
2
5
1
3
node
values
1
2
3
Target:
3.7
Closest:
-
Diff:
-
4
2
5
1
3
node
values
1
2
3
4
Target:
3.7
Closest:
-
Diff:
-
4
2
5
1
3
values
1
2
3
4
5
Target:
3.7
Closest:
1
Diff:
-
4
2
5
1
3
val
values
1
2
3
4
5
Target:
3.7
Closest:
1
Diff:
1.7 vs 2.7
4
2
5
1
3
val
values
1
2
3
4
5
Target:
3.7
Closest:
3
Diff:
0.3 vs 0.7
4
2
5
1
3
values
1
2
3
4
5
Target:
3.7
Closest:
4
Diff:
-
algo
master
.
io
Step:
values = [] (collect every value first)
0 / 34
Input
Standard
Between Nodes
Single Path
Custom
tree
=
[4, 2, 5, 1, 3]
,
target
=
3.7
0 / 34
algo
master
.
io
Step:
values = [] (collect every value first)
