Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
Oppiskele BST Deletion | Trees Part I
Practice
Projects
Quizzes & Challenges
Visat
Challenges
/
Data Structure & Algorithms PART I

bookBST Deletion

Pyyhkäise näyttääksesi valikon

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.

Oliko kaikki selvää?

Miten voimme parantaa sitä?

Kiitos palautteestasi!

Osio 3. Luku 7

Kysy tekoälyä

expand

Kysy tekoälyä

ChatGPT

Kysy mitä tahansa tai kokeile jotakin ehdotetuista kysymyksistä aloittaaksesi keskustelumme

Osio 3. Luku 7
some-alt