BST Deletion
There are also some cases while deleting nodes from the tree:
- Deleting the leaf node;
- Deleting the node with 1 child;
- Deleting the node with 2 children.
Deleting the leaf node
We may simple remove the leaf node without any crucial changes in the tree.
Deleting the node with 1 child:
-
Replace that node with its child node;
-
Remove the child node from its original position.
Deleting the node with 2 children:
-
Get the inorder successor of that node;
-
Replace the node with the inorder successor;
-
Remove the inorder successor from its original position.
Obrigado pelo seu feedback!
Pergunte à IA
Pergunte à IA
Pergunte o que quiser ou experimente uma das perguntas sugeridas para iniciar nosso bate-papo
Awesome!
Completion rate improved to 4.35
BST Deletion
Deslize para mostrar o menu
There are also some cases while deleting nodes from the tree:
- Deleting the leaf node;
- Deleting the node with 1 child;
- Deleting the node with 2 children.
Deleting the leaf node
We may simple remove the leaf node without any crucial changes in the tree.
Deleting the node with 1 child:
-
Replace that node with its child node;
-
Remove the child node from its original position.
Deleting the node with 2 children:
-
Get the inorder successor of that node;
-
Replace the node with the inorder successor;
-
Remove the inorder successor from its original position.
Obrigado pelo seu feedback!