Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Closest Binary Search Tree Value
Bookmark
Input
Standard
Between Nodes
Single Path
Custom
tree
=
[4, 2, 5, 1, 3]
,
target
=
3.7
4
2
5
1
3
Target:
3.7
Closest:
-
Diff:
-
4
2
5
1
3
Target:
3.7
Closest:
-
Diff:
-
4
2
5
1
3
node
closest
Target:
3.7
Closest:
4
Diff:
-
4
2
5
1
3
node
closest
Target:
3.7
Closest:
4
Diff:
0.3 vs 0.3
4
2
5
1
3
node
closest
Target:
3.7
Closest:
4
Diff:
0.3 vs 0.3
4
2
5
1
3
node
closest
Target:
3.7
Closest:
4
Diff:
1.7 vs 0.3
4
2
5
1
3
node
closest
Target:
3.7
Closest:
4
Diff:
1.7 vs 0.3
4
2
5
1
3
node
closest
Target:
3.7
Closest:
4
Diff:
0.7 vs 0.3
4
2
5
1
3
closest
Target:
3.7
Closest:
4
Diff:
0.7 vs 0.3
4
2
5
1
3
closest
Target:
3.7
Closest:
4
Diff:
-
algo
master
.
io
Step:
BST built. Find the value closest to target = 3.7
0 / 8
Input
Standard
Between Nodes
Single Path
Custom
tree
=
[4, 2, 5, 1, 3]
,
target
=
3.7
0 / 8
algo
master
.
io
Step:
BST built. Find the value closest to target = 3.7
