Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.Apprendre BST Deletion | Trees Part I
Data Structure & Algorithms PART I

bookBST 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.

Tout était clair ?

Comment pouvons-nous l'améliorer ?

Merci pour vos commentaires !

Section 3. Chapitre 7

Demandez à l'IA

expand

Demandez à l'IA

ChatGPT

Posez n'importe quelle question ou essayez l'une des questions suggérées pour commencer notre discussion

Awesome!

Completion rate improved to 4.35

bookBST Deletion

Glissez pour afficher le 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.

Tout était clair ?

Comment pouvons-nous l'améliorer ?

Merci pour vos commentaires !

Section 3. Chapitre 7
some-alt