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.

Answer 1

Method that tests if an array is a valid heap
boolean isValidHeap(int heap[], int n) {
        for (int i = 0; i <= (n - 2) / 2; i++) {
            // If value of left child is greater, then return false
            if (heap[2 * i + 1] > heap[i]) {
                return false;
            }

            // If value of right child is greater, then return false
            if ((2 * i + 2) < n && heap[2 * i + 2] > heap[i]) {
                return false;
            }
        }
        return true;
    }