Skip to main content

Binary tree deletion

Do not get all scared and worried. It is not rocket science (or as I would like to call it - it is not regex).

Remember deleting a node from linked list. When you deleted a node, you did the following 2 steps
  1. Free the memory of the node
  2. Link the previous node of the deleted node to the next node

You will have to do these things in binary tree too. But the difficulty here is do you link the previous node - or parent node in tree terminology, to the left child of deleted node? Or to the right child? You can not link both children, as the parent already may have one child node.

So before we solve this, let us categorize the deletion with the help of a diagram.



Consider the cases

  1. The node to be deleted is a leaf node. That is, it does not have left or right child. In this case, link the parent to NULL in place of deleted node. 
    • If you want to delete 13 - which is a leaf node, you set 14->left to NULL and free memory of node 13.
    • If you want to delete 7 - which is also a leaf node and is the right child of 6, you set 6->right to NULL and free 6.
  2. The node is to deleted is having only one subtree and hence one child node. In this case link the parent to this child node.
    • If you want to delete 14 - which has only left child node, you link the only child of 14 to the parent. That is you set 10->right to 14->left. Now 10 will have right child as 13. And BST property holds good.
    • Instead if you want to delete 10 which has only right subtree - 14 and 13, you link parent of 10 to  14. That is, you set 8->right to 14. 
  3. The node to be deleted has both branches. In this case, you find the successor of the node - which will be treeminimum of right sub tree. Copy the data of this tree minimum to the node to be deleted. And finally delete this tree minimum.
    • If you want to delete 3, you search for minimum of right subtree of 3. Right subtree of 3 has 3 nodes in it, 6,4 and 7. Minimum of this is 4. Copy the data - 4 into the node to be deleted -which is 3. Now you delete the node with 4.  
Delete the node with only left subtree

Delete the node with only right subtree

Delete the node with both subtrees

 Why tree minimum of right subtree?

When you delete a node, its place can be taken by its predecessor or its successor. We are choosing successor here is a substitute for node to be deleted. And we are preserving its information by copying it into the original to-be deleted node. 

Again, why not any other node? Because this subtree minimum will be either a leaf node or it will have only right branch. So we are reducing it to case 2. - that is node with only one branch or 0 branches. 

Next let us look at the code. I have written a recursive function here. You can also a find function to find tree minimum.

The advantage of recursive function is, you don't have to write separate functions to search a node, find the parent node etc.  Of course at the expense of simplicity.

NODEPTR delete_node(NODEPTR nd,int delval)
{
 if(nd==NULL)
          return nd;
 if(nd->val >delval)
           nd->left = delete_node(nd->left,delval);
        else if(nd->val < delval)
           nd->right = delete_node(nd->right,delval);
        else/*node found*/
        {
           if(nd->left==NULL && nd->right==NULL)/*leaf node*/
               {
                   free(nd);
     nd = NULL;
               }
           else if(nd->left==NULL)/*only right child*/
              {
                 NODEPTR temp = nd->right;
                 free(nd);
                 nd =temp;
              }
           else if(nd->right==NULL)/*only left child*/
              {
                 NODEPTR temp = nd->left;
                 free(nd);
                 nd = temp;
              }
           else/*both branches*/
            {
              NODEPTR min_node = find_rightst_min(nd->right);
              nd->val = min_node->val;/*copy value of minimumNode*/
              nd->right = delete_node(nd->right,min_node->val);/*delete minimumNode*/
            }         
      }
    return nd;  
}

/*go left till you reach null*/
NODEPTR find_rightst_min(NODEPTR nd)
{
     NODEPTR temp = nd;
     while(nd)
     {
        temp = nd;
        nd = nd->left;
      }
      return temp;
}

Now let us write the complete program where you keep deleting different nodes in a loop.


#include<stdio.h>
#include<stdlib.h>
struct node
{
   int val;
   struct node *left;
   struct node *right;
};
typedef struct node *NODEPTR;

NODEPTR create_node(int num)
{
     NODEPTR temp = (NODEPTR)malloc(sizeof(struct node));
     temp->val = num;
     temp->left = NULL;
     temp->right = NULL;
     return temp;
}

NODEPTR insert_node(NODEPTR nd,NODEPTR newnode)
{
    if(nd==NULL)
       return newnode;/* newnode becomes root of tree*/
    if(newnode->val > nd->val)
        nd->right = insert_node(nd->right,newnode);
    else if(newnode->val <  nd->val)
        nd->left = insert_node(nd->left,newnode); 
    return nd;   
}

void in_order(NODEPTR nd)
{
   if(nd!=NULL)
    {
        in_order(nd->left);
        printf("%d---",nd->val);
        in_order(nd->right);
     }
}

void pre_order(NODEPTR nd)
{
   if(nd!=NULL)
    {
        printf("%d---",nd->val);   
        pre_order(nd->left);
        pre_order(nd->right);
            
     }
}

void post_order(NODEPTR nd)
{
   if(nd!=NULL)
    {    
 post_order(nd->left);
        post_order(nd->right);
        printf("%d---",nd->val);
     }
}


/*go left till you reach null*/
NODEPTR find_rightst_min(NODEPTR nd)
{
     NODEPTR temp = nd;
     while(nd)
     {
        temp = nd;
        nd = nd->left;
      }
      return temp;
}
NODEPTR delete_node(NODEPTR nd,int delval)
{
 if(nd==NULL)
          return nd;
 if(nd->val >delval)
           nd->left = delete_node(nd->left,delval);
        else if(nd->val < delval)
           nd->right = delete_node(nd->right,delval);
        else/*node found*/
        {
           if(nd->left==NULL && nd->right==NULL)
               {
                   free(nd);
     nd = NULL;
               }
           else if(nd->left==NULL)/*leaf node*/
              {
                 NODEPTR temp = nd->right;
                 free(nd);
                 nd =temp;
              }
           else if(nd->right==NULL)/*leaf node*/
              {
                 NODEPTR temp = nd->left;
                 free(nd);
                 nd = temp;
              }
           else
            {
              NODEPTR min_node = find_rightst_min(nd->right);
              nd->val = min_node->val;
              nd->right = delete_node(nd->right,min_node->val);
            }
         
      }
return nd;
 
  
}
int main()
{
       NODEPTR root=NULL,delnode; 
       int n;
       do
       {
           NODEPTR newnode;
           printf("Enter value of node(-1 to exit):");
           scanf("%d",&n);
           if(n!=-1)
            {  
               newnode = create_node(n);
               root = insert_node(root,newnode);
             }
       } while (n!=-1);
       
       printf("\nInorder traversal\n");
       in_order(root);
      
       
       while(1){ 
   printf("Enter node to be deleted(-1 to stop)");
         scanf("%d",&n);
  if(n==-1)
   break;
           root = delete_node(root,n);
           printf("now tree is");
  in_order(root);
       }    
       return 0;
}
Labels:

Comments

Post a Comment

Popular posts from this blog

Delete a node from doubly linked list

Deletion operation in DLL is simpler when compared to SLL. Because we don't have to go in search of previous node of to-be-deleted node.  Here is how you delete a node Link previous node of node of to-be-deleted to next node. Link next node of node of to-be-deleted to previous node. Free the memory of node of to-be-deleted Simple, isn't it. The code can go like this. prevnode = delnode->prev; nextnode = delnode->next; prevnode->next = nextnode; nextnode->prev = prevnode; free(delnode); And that is it. The node delnode is deleted. But we should always consider boundary conditions. What happens if we are trying to delete the first node or last node? If first node is to be deleted, its previous node is NULL. Hence step 3 should not be used.  And also, once head is deleted, nextnode becomes head . Similarly if last node is to be deleted, nextnode is NULL. Hence step 4 is as strict NO NO. And we should set prevnode to tail. After we put these things together, we have...
Post a Comment
Read more

Function to sort an array using bubble sort

Quick and dirty way of sorting an array is bubble sort. It is very easy to write and follow. But please keep in mind that it is not at all effecient. #include<iostream> using std::cin; using std::cout; void readArray(int arr[],int sz); void printArray(int arr[],int sz); void sortArray(int arr[],int sz); void swap(int &a,int &b); int main() {    int sz;    cout<<"Size of the array=";    cin>>sz;    int arr[sz];    readArray(arr,sz);     sortArray(arr,sz);   cout<<"Sorted array is ";   printArray(arr,sz); } void readArray(int arr[],int sz) {  for(int i=0;i<sz;i++)    {       cout<<"arr["<<i<<"]=";       cin>>arr[i];   } } void printArray(int arr[],int sz) {  for(int i=0;i<sz;i++)    {       cout<<"arr["<<i<<"]=";    ...
Post a Comment
Read more

Merge two binary search trees

How do you merge two binary search trees? I googled about the solutions. Most solutions told me to convert both trees into linked lists. Merge the lists. Then create a tree from the elements of the list. But why lists? Why can't we store the elements in an array? Because if the data of the tree is larger - not just integer keys, array manipulation becomes difficult. But again, we need not convert both the trees into lists. We can convert one tree into list - a doubly linked list. Then insert the elements of this list into the other tree. I tried this approach. To convert a tree into a sorted doubly linked list Create a doubly linked list. Let the prev and next links of nodes in this list be called left and right respectively. This way we can directly use the binary tree nodes in the list. Use a static variable previousnode  call the function recursively for left child of current node. link current node to the previousnode set next pointer of previousnode to curre...
Post a Comment
Read more