Skip to main content

Implementation of binary tree in C++


A binary tree is a non-linear data structure where every node has maximum two branches - left subtree and right subtree. An empty node is also a binary tree.

In earlier posts we have seen how to insert a node to binary tree, how to traverse a tree and how to delete nodes from tree.

The functions look almost similar in C++. Except that all these functions and root pointer are all parts of the class binary tree.

That is a good thing and a bad thing. If root is a data member (so private), how do we use root as a parameter in all the recursive functions - insert, delete, inorder etc?

Easy answer would be don't use recursion. Anyway no one like them.

So we can write insert and delete functions without using recursion and even search function. But traversal functions have to be recursive.

Ok, let us write a function to return root of the tree and use it as first parameter in all traversal functions.

Here is the complete class.

You can download this code along with test program from here


struct node
{
   int num;
   node *left;
   node *right;
};
class binarytree
{
   node *root;
public:
   binarytree();
   node* create_node(int val);
   void insert( int val); 
   void inorder(node *nd);
   void preorder(node *nd);
   void postorder(node *nd);
   node *search(node *nd,int val);
   void delete_node(int val);
   node*find_parent(node *nd);
   node*find_successor(node*nd,node**parent);
   node* get_root();
};
binarytree::binarytree()
{
    root = NULL;
}
node *binarytree::create_node(int val)
{
   node *newn = new node;
   newn->num = val;
   newn->left = NULL;
   newn->right = NULL;
   return newn;
}
void binarytree::insert( int val)
{//insert a node non-recursively
    node*newnode = create_node(val);
    if(root==NULL)
    {//tree is empty
       root = newnode;
       return;
    }
    node *temp = root;
    node *parent = NULL;
    while(temp!=NULL)
    {//find the location for new node
        parent = temp;
        if(temp->num >val)
           temp = temp->left;
        else
           temp = temp->right;
     }
     //which branch
     if(parent->num >val)
        parent->left = newnode;
     else
        parent->right = newnode;    
}

void binarytree::inorder(node *nd)
{
  if(nd!=NULL)
  {
     inorder(nd->left);
     cout<<nd->num<<"  ";
     inorder(nd->right);
   }
}
void binarytree::preorder(node *nd)
{
  if(nd!=NULL)
  {
     cout<<nd->num<<"  ";
     preorder(nd->left);   
     preorder(nd->right);
   }
}
void binarytree::postorder(node *nd)
{
  if(nd!=NULL)
  {
     postorder(nd->left);   
     postorder(nd->right);
     cout<<nd->num<<"  ";
   }
}
node* binarytree::search(node *nd, int val)
{
     if(nd==NULL)
       return nd;
     if(nd->num==val)
        return nd;
     if(nd->num > val)
       return search(nd->left,val);
     if(nd->num <val)
       return search(nd->right,val);
}
node *binarytree::find_parent(node *nd)
{
    if(nd==root)
    //root has no parent
       return NULL;
    node *temp = root;
    while(temp)
    {
       if(temp->left==nd || temp->right==nd)
          return temp;
       if(nd->num > temp->num)
         temp = temp->right;
       else if(nd->num <temp->num)
         temp = temp->left;
    }
    return NULL;
}
node*binarytree::find_successor(node*nd,node**parent)
{//successor is tree minimum of right subtree
   node*temp = nd->right;
   *parent = nd;
   while(temp->left!=NULL)
      {
      *parent=temp;
      temp = temp->left;
      }
   return temp;
}
         
void binarytree::delete_node(int val)
{
    node *dn = search(root,val);
    if(dn==NULL)
      {
        cout<<"value not found\n";
        return;
      }
     node*parent = find_parent(dn);
    if(dn->left!=NULL && dn->right!=NULL)
    {//node has both subtrees. delete successor instead
        node*successor = find_successor(dn,&parent);
        dn->num = successor->num;//copy data
        dn = successor;
    }    
   
    if(dn->left==NULL && dn->right==NULL)
    {//leaf node
       
        if(parent==NULL && dn==root)
           root = NULL;
        else if(parent==NULL)
           cout<<"Error";
        else
           if(dn==parent->left)
              parent->left = NULL;
           else if(dn==parent->right)
              parent->right = NULL;
        delete dn;
    }
    else if(dn->left==NULL||dn->right==NULL)
    {//has one child
         
         node* child = dn->left?dn->left:dn->right;
         if(dn==root)
             root = child;
         else{
            if(parent->left==dn)
              parent->left = child;
            else
             parent->right = child;
          }
          delete dn;
    }
}
node*binarytree::get_root()
{
   return root;
}
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

Binary tree deletion - non-recursive

In the previous post we have seen how to delete a node of a binary search tree using recursion. Today we will see how to delete a node of BST using a non-recursive function. Let us revisit the 3 scenarios here Deleting a node with no children just link the parent to NULL Deleting a node with one child link the parent to  non-null child of node to be deleted Deleting a node with both children select the successor of node to be deleted copy successor's value into this node delete the successor In order to start, we need a function to search for a node in binary search tree. Did you know that searching in  a BST is very fast, and is of the order O(logn). To search Start with root Repeat until value is found or node is NULL If the search value is greater than node branch to right If the search value is lesser than node branch to left.  Here is the function NODEPTR find_node (NODEPTR root,NODEPTR * parent, int delval) { NODEPTR nd = root; NODEPTR pa = root; if (ro...
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