问确定数组[1...n]是否为最大堆

EN

/ Returns true if arr[i..n-1] represents a 
// max-heap 
bool isHeap(int arr[], int i, int n) 
{ 
// If a leaf node 
if (i > (n - 2)/2) 
    return true; 

// If an internal node and is greater than its children, and 
// same is recursively true for the children 
if (arr[i] >= arr[2*i + 1] && arr[i] >= arr[2*i + 2] && 
    isHeap(arr, 2*i + 1, n) && isHeap(arr, 2*i + 2, n)) 
    return true; 

return false; 
}