How deletion in BST tree data structure works?

Question

0.00/5 (No votes)

See more:

.[^] // full code

C++

else if(root->left == NULL) {         //confusing part in deleting node with one child    
struct Node *temp = root;
root = root->right;
delete temp;
}

After deleting the temp, what about the link between temp's parent and current root ? I am little confused here. pls explain .

What I have tried:

I have tried linking the root with the last leaf , but somehow I am losing the link of the root to connect it with the leaf node.

Posted 7-Dec-16 7:54am

Member 12719168

Updated 7-Dec-16 10:55am

CPallini

v2

Add a Solution

1 solution

Add a Solution

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Answer 1 · 2016-12-07T10:55:00

Solution 1

before deletion

root = node1
      /    \
    NULL  node2
          /   \
         whatever

after deletion

root = node2
       /   \
      whatever

Posted 7-Dec-16 10:55am

CPallini

Comments

Member 12719168 7-Dec-16 20:39pm

if I want to delete node 2 ,the format is connect node1 with the child of node2 (in case of only one child ) After recursion node2 becomes my root .. so root =root->right ......will connection b/w the parent will not be cutoff ... ? can you clarify that part alone. Thanks!!

How deletion in BST tree data structure works?

1 solution

Solution 1

Add your solution here

Preview 0

How deletion in BST tree data structure works?

1 solution

Solution 1

Add your solution here

Preview 0

Existing Members

...or Join us