Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Search in a Binary Search Tree
Bookmark
Brute Force DFS
BST Recursive
BST Iterative
Input
Example 1 (Found)
Example 2 (Not Found)
Example 3 (Large Tree)
Custom
treeNodes
=
[4, 2, 7, 1, 3]
,
target
=
2
4
2
7
1
3
curr
4
2
7
1
3
curr
4
2
7
1
3
curr
4
2
7
1
3
curr
4
2
7
1
3
curr
4
2
7
1
3
curr
4
2
7
1
3
curr
4
2
7
1
3
curr
algo
master
.
io
Step:
Start: curr = root, searching for 2
0 / 6
Input
Example 1 (Found)
Example 2 (Not Found)
Example 3 (Large Tree)
Custom
treeNodes
=
[4, 2, 7, 1, 3]
,
target
=
2
0 / 6
algo
master
.
io
Step:
Start: curr = root, searching for 2
