Contenido del Curso
Data Structure & Algorithms PART I
Data Structure & Algorithms PART I
2. Data Structures Part I
4. Trees Part II
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.
¿Todo estuvo claro?
¡Gracias por tus comentarios!
Sección 3. Capítulo 7