Question

In this question you are working with a max heap of integers, where the integer represents a priority, with larger integers being higher priority. Write a method that will test if a given heap array is correctly ordered (i.e. write a method that tests if an array is a valid heap). The method should accept (i) an array of integers (the heap), and (ii) the current number of items in the heap, and should return a boolean.

java language

Answer 1

Program Code Screenshot ;

1 import java.util.Arrays; 2 3 class Main 4 5 a 6 7 public static boolean isMaxHeap(int arr[], int n){ // Loop all nodes for(int i=0;i<n;i++){ //Check if left value is gretaer if(2*i+1<n && arr[2*i+1]>arr[i]){ return false; 8 9 19 11 نها 12 13 - //Check if right value is greater if(2*1+2<n && arr[2*1+2]>arr[i]){ return false; 14 15 نہا 16 نہا 17 return true; 18 نہا 19 29 public static void main(String[] args) { int heap [] = {9,8,6,5,2,1); System.out.println(Arrays.toString(heap)+" : "+isMaxHeap (heap, heap.length)); 21 22 23 }

Sample Output :

Run: Main "C:\Program Files\Java\jdk-13\bin\java.exe" [9, 8, 6, 5, 2, 1] : true 5 Process finished with exit code

Program Code to Copy

import java.util.Arrays;

class Main{

    public static boolean isMaxHeap(int arr[], int n){
        //Loop all nodes
        for(int i=0;i<n;i++){
            //Check if left value is gretaer
            if(2*i+1<n && arr[2*i+1]>arr[i]){
                return false;
            }
            //Check if right value is greater
            if(2*i+2<n && arr[2*i+2]>arr[i]){
                return false;
            }
        }
        return true;
    }
    public static void main(String[] args) {
        int heap[] = {9,8,6,5,2,1};
        System.out.println(Arrays.toString(heap)+" : "+isMaxHeap(heap,heap.length));
    }
}