Complete Binary Tree Implementation and Program in C++

In my Last post I discussed about Algorithm for searching an element or node in Binary Search Tree . Binary Tree is a non-linear Data Structure which helps in traversing and improving timing complexity when compared to other Data Structures .
In this post I will discuss about Implementation of Complete Binary Tree and Program for Complete Binary tree in C++ .

Also check : Program for Linear search in C++

Implementation of Complete Binary Tree :

Download Source code

Here we discuss 3 major Implementations of Complete Binary Tree .
1. Inserting a Node or Insertion
2. Deleting a Node or Deletion
3. Display the elements in Complete Binary Tree 
    

1. Insertion :

Insert Operation involves inserting a new element or node in Complete Binary Tree . Insertion should be done in such a way that it does not effect the structure of the Tree . First element is inserted in a node known as root node . Next elements are inserted according to the index order of array .
for eg : consider an array a[10] 
     1st element is inserted in a[0]
     2nd element is inserted in a[1] and it goes to maximum insertion of a[9].    
Code for Insertion :

void insert()
{
if(pos<size)
{
cout<<"\n enter element \n";
cin>>a[pos++];
cout<<"\n inserted value successfully \n";
}
else
{
cout<<"\n overflow -- Cannot insert \n";
}
}

2. Deletion :

Deletion implies Deleting a Node from the Complete Binary Tree . Node cannot be completely Deleted if you implement using arrays , Node will be logically deleted . Node can be permanently deleted by implementing complete Binary Tree using LinkedList.
Code for Deletion :

void remove()
{
int i,x;
cout<<"\n enter element to be deleted \n";
cin>>x;
for(i=0;i<size;i++)
{
if(x==a[i])
break;
}
if(i>=size)
cout<<"\n element not found \n";
a[i]=a[pos-1];
a[pos-1]=-1;
pos--;
}

3. Display : 

Display function displays all the elements of Binary Tree . Display helps in displaying the root nodes , child nodes and also leaf nodes .  
Code for Display :      

void display()
{
int i;
for(i=0;i<size;i++)
{
if(2*i+1<size && a[2*i+1]!=-1 && a[2*i+2]!=-1)
{
cout<<"\n Parent is "<<a[i]<<" left is "<<a[2*i+1]<<" right is "<<a[2*i+2]<<"\n";
}
if(a[2*i+1]!=-1 && a[2*i+2]==-1)
{
cout<<"\n Parent is "<<a[i]<<" left is "<<a[2*i+1]<<"\n";
}
if(a[i]!=-1 && a[2*i+1]==-1 && a[2*i+2]==-1)
{
cout<<"\n Leaf node is "<<a[i]<<"\n";
}
}
}

To get the complete code of Complete Binary Tree Download here . 
If you feel I have missed anything please get it to me through comments . Also Share your ideas and logics with us through comments .