Question

Task: A ternary heap is like a binary heap, except instead of each node having a max of two children, each node has a max of three children. Given a ternary min heap, return true if it is a valid heap. That is, it satisfies the heap property (the parent is less than all of its children) Requirements: Implement an isValidHeap function to determine whether a particular array of integers constitutes a valid ternary min-heap. bool isValidHeap(int arr[])// example declaration Examples If arr(4,7,10,6,12,9) then isValidHeap(arr) should return true If arr(5,10,9,4,12) then isValidHeap(arr) should return false If arr(10 then isValidHeap(arr) should return true Use the starter code in Moodle and the implementations you have prepared. Write a main function that creates an array of integers, then calls the function defined above to demonstrate the method. Call it on multiple arrays to show that it works in all cases, and print out the results.

Answer 1

Source Code in C++:

#include <iostream>
#include <iterator>
using namespace std;

bool isValidHeap(int arr[],int n) //function to check if an array is a valid terneary min heap
{
for(int i=0;i<n;i++) //iterating through all the nodes
{
for(int j=3*i+1;j<=3*i+3 && j<n;j++) //iterating through the child nodes for every node, if available
{
if(arr[i]>arr[j]) //if a parent node is higher than child node, it is not valid
return false;
}
}
return true; //if program reaches this point, heap was valid min heap
}

int main()
{
//testing the function
int arr1[]={4,7,10,6,12,9};
cout << "Array1 is " << (isValidHeap(arr1,6)?"":"not") << "a valid heap" << endl;
int arr2[]={5,10,9,4,12};
cout << "Array2 is " << (isValidHeap(arr2,5)?"":"not ") << "a valid heap" << endl;
return 0;
}

Output:

CAUsers Debjit G Documents heap.exe" Array2 is not a valid heap Pro cess returned 0 <0x0> execution tine 0.014 s Press any key to continue.