Question

c++

*construct (draw) a Max Heap when the following keys are inserted in the given order:

5, 10, 4, 3, 1, 15, 11, 12, 20, 19, 2

*What is the index of the right child of key 20?

*Draw the max Heap after performing removeMax()

Answer 1

Code -

#include <iostream>
#include <conio.h>
using namespace std;
void max_heapify(int *a, int i, int n)
{
int j, temp;
temp = a[i];
j = 2 * i;
while (j <= n)
{
if (j < n && a[j+1] > a[j])
j = j + 1;
if (temp > a[j])
break;
else if (temp <= a[j])
{
a[j / 2] = a[j];
j = 2 * j;
}
}
a[j/2] = temp;
return;
}
void build_maxheap(int *a,int n)
{
int i;
for(i = n/2; i >= 1; i--)
{
max_heapify(a,i,n);
}
}
int main()
{
int n, i, x;
int a[] ={5, 10, 4, 3, 1, 15, 11, 12, 20, 19, 2};
n =(sizeof(a)/sizeof(*a));
build_maxheap(a,11);
cout<<"Max Heap\n";
for (i = 1; i <= n; i++)
{
cout<<a[i]<<endl;
}
getch();
}

Screenshots -