Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Delete Node in a BST
Bookmark
Recursive
Iterative
Input
Two children (root)
One child
Leaf node
Custom
tree
=
[5, 3, 7, 2, 4, 6, 8]
,
key
=
5
key = 5
5
3
7
2
4
6
8
Current
On path
Successor
Removed
Relinked
key = 5
5
3
7
2
4
6
8
Current
On path
Successor
Removed
Relinked
key = 5
5
3
7
2
4
6
8
current
Call Stack
deleteNode(5)
Current
On path
Successor
Removed
Relinked
key = 5
5
3
7
2
4
6
8
current
successor
Call Stack
deleteNode(5)
Current
On path
Successor
Removed
Relinked
key = 5
5
3
7
2
4
6
8
current
successor
Call Stack
deleteNode(5)
Current
On path
Successor
Removed
Relinked
key = 5
6
3
7
2
4
6
8
current
Call Stack
deleteNode(5)
Current
On path
Successor
Removed
Relinked
key = 5
6
3
7
2
4
6
8
current
Call Stack
deleteNode(7)
deleteNode(5)
Current
On path
Successor
Removed
Relinked
key = 5
6
3
7
2
4
6
8
current
Call Stack
deleteNode(6)
deleteNode(7)
deleteNode(5)
Current
On path
Successor
Removed
Relinked
key = 5
6
3
7
2
4
8
current
Call Stack
deleteNode(7)
deleteNode(5)
Current
On path
Successor
Removed
Relinked
key = 5
6
3
7
2
4
8
current
Call Stack
deleteNode(5)
Current
On path
Successor
Removed
Relinked
key = 5
6
3
7
2
4
8
Call Stack
empty
Current
On path
Successor
Removed
Relinked
algo
master
.
io
Step:
Delete node with key = 5 from BST
0 / 18
Input
Two children (root)
One child
Leaf node
Custom
tree
=
[5, 3, 7, 2, 4, 6, 8]
,
key
=
5
0 / 18
algo
master
.
io
Step:
Delete node with key = 5 from BST
