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.
Дякуємо за ваш відгук!
Запитати АІ
Запитати АІ
Запитайте про що завгодно або спробуйте одне із запропонованих запитань, щоб почати наш чат
Запитайте мені питання про цей предмет
Сумаризуйте цей розділ
Покажіть реальні приклади
Awesome!
Completion rate improved to 4.35BST 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.
Дякуємо за ваш відгук!
