Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Inorder Successor in BST
Bookmark
Inorder Collect
Early Termination
BST Property
Input
Standard (successor = 5)
Successor is ancestor (successor = 20)
No successor (rightmost node)
Custom
tree
=
[5, 3, 7, 2, 4, 6, 8]
,
p
=
4
p = 4
5
3
7
2
4
6
8
nodes
empty
Current
Visited
Node p
Successor
p = 4
5
3
7
2
4
6
8
nodes
empty
Current
Visited
Node p
Successor
p = 4
5
3
7
2
4
6
8
current
nodes
empty
Current
Visited
Node p
Successor
p = 4
5
3
7
2
4
6
8
current
nodes
2
Current
Visited
Node p
Successor
p = 4
5
3
7
2
4
6
8
current
nodes
2
3
Current
Visited
Node p
Successor
p = 4
5
3
7
2
4
6
8
current
nodes
2
3
4
5
Current
Visited
Node p
Successor
p = 4
5
3
7
2
4
6
8
current
nodes
2
3
4
5
6
Current
Visited
Node p
Successor
p = 4
5
3
7
2
4
6
8
current
nodes
2
3
4
5
6
7
Current
Visited
Node p
Successor
p = 4
5
3
7
2
4
6
8
current
nodes
2
3
4
5
6
7
8
Current
Visited
Node p
Successor
p = 4
5
3
7
2
4
6
8
current
nodes
2
3
4
5
6
7
8
Current
Visited
Node p
Successor
p = 4
5
3
7
2
4
6
8
successor
nodes
2
3
4
5
6
7
8
Current
Visited
Node p
Successor
algo
master
.
io
Step:
nodes = [] (collect the in-order sequence, p = 4)
0 / 37
Input
Standard (successor = 5)
Successor is ancestor (successor = 20)
No successor (rightmost node)
Custom
tree
=
[5, 3, 7, 2, 4, 6, 8]
,
p
=
4
0 / 37
algo
master
.
io
Step:
nodes = [] (collect the in-order sequence, p = 4)
