Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Minimum Absolute Difference in BST
1
getMinimumDifference(Node(4))
Standard (minDiff=1)
Mixed (minDiff=1)
Balanced (minDiff=2)
Custom
tree
=
[4, 2, 6, 1, 3]
4
2
6
1
3
minDiff = ∞
sorted
minDiff =
∞
, prev =
null
4
2
6
1
3
minDiff = ∞
sorted
minDiff =
∞
, prev =
null
4
2
node
6
1
3
minDiff = ∞
sorted
inorder(
2
.left)
4
2
6
1
node
3
minDiff = ∞
sorted
1
prev = null:
1
is the smallest value, nothing to compare
4
2
node
6
1
#1
3
minDiff = ∞
sorted
1
prev
2
diff =
2
-
1
=
1
4
2
#2
6
1
#1
3
node
minDiff = 1
sorted
1
2
prev
inorder(
3
.left)
4
2
#2
6
1
#1
3
#3
node
minDiff = 1
sorted
1
2
3
prev
prev =
3
4
node
2
#2
6
1
#1
3
#3
minDiff = 1
sorted
1
2
3
prev
4
diff =
4
-
3
=
1
4
#4
2
#2
6
node
1
#1
3
#3
minDiff = 1
sorted
1
2
3
4
prev
inorder(
6
.left)
4
#4
2
#2
6
#5
node
1
#1
3
#3
minDiff = 1
sorted
1
2
3
4
6
prev
prev =
6
4
#4
2
#2
6
#5
1
#1
3
#3
minDiff = 1
sorted
1
2
3
4
6
return minDiff = 1
Step:
Start: minDiff = Infinity, prev = null; inorder visits BST values in sorted order
0 / 42
Standard (minDiff=1)
Mixed (minDiff=1)
Balanced (minDiff=2)
Custom
tree
=
[4, 2, 6, 1, 3]
0 / 42
Step:
Start: minDiff = Infinity, prev = null; inorder visits BST values in sorted order
1
getMinimumDifference(Node(4))
