Program to Implement Insertion In Heap in C/C++

// Insertion In Heap Tree Data Structure

#include<bits/stdc++.h>
using namespace std;

int arr[10],n;

void insertHeap(int num,int loc)
{


int par;
while(loc>0)
{
par=(loc-1)/2;
if(num<=arr[par])
{
arr[loc]=num;
return;
}

arr[loc]=arr[par];
loc=par;
}

arr[0]=num;
}
void disp(int n)
{
for(int i=0;i<n;i++)
cout<<" "<<arr[i];
}


main()
{
n=0;

insertHeap(50,n);
n+=1;
insertHeap(30,n);
n+=1;
insertHeap(40,n);
n+=1;
insertHeap(29,n);
n+=1;
insertHeap(55,n);
n+=1;
cout<<"Insertion In HEAP: ";
disp(n);


}