title: How To Check If A Given Array Represents A Binary Heap 1
signature: function how_to_check_if_a_given_array_represents_a_binary_heap_1(arr, n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(arr, n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(arr, n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver([2, 2, 2, 7, 10, 14, 24, 38, 42, 50, 59, 60, 72, 73, 79, 83, 89], 9, false);
      @printf("TEST-0...%s\n",result);
      
      result = driver([-48, 98, 96, -56, -2, 58, 52, -50, 58, 50, 62, 86, -26, -98, 34, 20, -28, 56, -36], 9, false);
      @printf("TEST-1...%s\n",result);
      
      result = driver([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 20, false);
      @printf("TEST-2...%s\n",result);
      
      result = driver([91, 50, 37], 2, true);
      @printf("TEST-3...%s\n",result);
      
      result = driver([-80, -26, 0, 0, 6, 14, 22, 76, 82, 88, 98], 10, false);
      @printf("TEST-4...%s\n",result);
      
      result = driver([1, 0], 1, true);
      @printf("TEST-5...%s\n",result);
      
      result = driver([9, 24, 24, 33, 48, 50, 55, 61, 69, 79, 83], 8, false);
      @printf("TEST-6...%s\n",result);
      
      result = driver([30, 32, -82, -48, 88, -24, 74, 2, 90, 98, 68, 82, 32, -60, 2, -94, 18, 14, 46, 50, -60, -74, -76, 66, -76, -34, -20, 82, -44, -62, 34, 48, -56, 2, 64, -78, -64, 98, -10, -28, 78, -42], 27, false);
      @printf("TEST-7...%s\n",result);
      
      result = driver([0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 6, false);
      @printf("TEST-8...%s\n",result);
      
      result = driver([38, 74, 99, 75, 44, 75, 24, 70, 78, 74, 60, 59, 34, 27, 7, 23, 19, 95, 4, 35, 38, 22, 46, 1, 44, 20, 52, 1, 96, 57, 5, 76, 49, 1, 37, 35], 31, false);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def how_to_check_if_a_given_array_represents_a_binary_heap_1(arr, n):
      for i in range((int(((n - 2) / 2)) + 1)):
          if (arr[((2 * i) + 1)] > arr[i]):
              return False
          if ((((2 * i) + 2) < n) and (arr[((2 * i) + 2)] > arr[i])):
              return False
      return True
source_cpp: bool how_to_check_if_a_given_array_represents_a_binary_heap_1(vector<int> arr, int n) {
    for ( int i = 0;
    i <= ( n - 2 ) / 2;
    i ++ ) {
      if ( arr [ 2 * i + 1 ] > arr [ i ] ) return false;
      if ( 2 * i + 2 < n && arr [ 2 * i + 2 ] > arr [ i ] ) return false;
    }
    return true;
  }