Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Minimum Distance Between BST Nodes
Bookmark
Input
Example 1
Example 2
Example 3
Custom
tree
=
[4, 2, 6, 1, 3]
4
2
6
1
3
minDiff = ∞
stack
sorted
inorder of a BST visits values in sorted order
4
2
6
1
3
minDiff = ∞
stack
sorted
inorder of a BST visits values in sorted order
4
2
curr
6
1
3
minDiff = ∞
stack
4
2
top
sorted
stack.push(
2
)
4
2
6
1
#1
curr
3
minDiff = ∞
stack
4
2
top
sorted
1
current = stack.pop() =
1
4
2
#2
curr
6
1
#1
3
minDiff = ∞
stack
4
top
sorted
1
prev
2
current = stack.pop() =
2
4
2
#2
6
1
#1
3
curr
minDiff = 1
stack
4
top
sorted
1
2
prev
current = current.right =
3
4
2
#2
6
1
#1
3
#3
curr
minDiff = 1
stack
4
top
sorted
1
2
prev
3
diff =
3
-
2
=
1
4
#4
curr
2
#2
6
1
#1
3
#3
minDiff = 1
stack
sorted
1
2
3
prev
4
current = stack.pop() =
4
4
#4
2
#2
6
curr
1
#1
3
#3
minDiff = 1
stack
sorted
1
2
3
4
prev
current = current.right =
6
4
#4
2
#2
6
#5
curr
1
#1
3
#3
minDiff = 1
stack
sorted
1
2
3
4
prev
6
diff =
6
-
4
=
2
4
#4
2
#2
6
#5
1
#1
3
#3
minDiff = 1
stack
sorted
1
2
3
4
6
return minDiff = 1
algo
master
.
io
Step:
Start: inorder traversal of a BST visits values in sorted order
0 / 36
Input
Example 1
Example 2
Example 3
Custom
tree
=
[4, 2, 6, 1, 3]
0 / 36
algo
master
.
io
Step:
Start: inorder traversal of a BST visits values in sorted order
