title: How To Check If A Given Array Represents A Binary Heap
signature: function how_to_check_if_a_given_array_represents_a_binary_heap(arr, i, n)
source_py: def how_to_check_if_a_given_array_represents_a_binary_heap(arr, i, n):
      if (i > int(((n - 2) / 2))):
          return True
      if ((arr[i] >= arr[((2 * i) + 1)]) and (arr[i] >= arr[((2 * i) + 2)]) and how_to_check_if_a_given_array_represents_a_binary_heap(arr, ((2 * i) + 1), n) and how_to_check_if_a_given_array_represents_a_binary_heap(arr, ((2 * i) + 2), n)):
          return True
      return False
source_cpp: bool how_to_check_if_a_given_array_represents_a_binary_heap(vector<int> arr, int i, int n) {
    if ( i > ( n - 2 ) / 2 ) return true;
    if ( arr [ i ] >= arr [ 2 * i + 1 ] && arr [ i ] >= arr [ 2 * i + 2 ] && how_to_check_if_a_given_array_represents_a_binary_heap ( arr, 2 * i + 1, n ) && how_to_check_if_a_given_array_represents_a_binary_heap ( arr, 2 * i + 2, n ) ) return true;
    return false;
  }
question_info.test_code: 
  
  -- SOLUTION CODE
  -- ============================================
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  function isCorrect(actual, expected)
      if type(expected) ~= type(actual) then
          return false
      end
      
      if type(expected) == 'table' then
          for k,v_expected in pairs(expected) do
              
              if actual[k] == nil then
                  return false
              end
              local v_actual = actual[k]
              if not isCorrect(v_actual, v_expected) then
                  return false
              end
              actual[k]=nil
          end
      
          if next(actual) then 
              return false
          end
          return true
      else
          return actual == expected
      end
  end
  
  function validateSolution(actual, expected)
      return isCorrect(actual,expected)
  end
  
  function driver(arr, i, n, expected)
      local exec_result;
      local status, error_msg = pcall(function () 
          exec_result=PLACEHOLDER_FN_NAME(arr, i, n) 
      end)
      if status then
          if validateSolution(exec_result,expected) then
              return "PASSED"
          end
          return "FAILED"
      else
          return string.format("ERROR=%s",string.gsub(error_msg,".*:[%d]+: ",""))
      end
  end
      
  function main()
      result = driver({1, 2, 3, 5, 24, 24, 25, 25, 36, 37, 37, 39, 42, 44, 46, 50, 51, 54, 56, 60, 62, 70, 71, 73, 75, 80, 80, 85, 86, 89, 91, 95, 99}, 0, 18, false)
      print(string.format("TEST-0...%s",result))
  
      result = driver({-44, -58, 88, -42, 42, -14, -44, 42, 64, 94, -46, -70, 34, -10, -46, -52, -6, -78, 64, 56, 74, 98, -34, -4, -92, 6, -52, -20, 78, -72, -40}, 0, 27, false)
      print(string.format("TEST-1...%s",result))
  
      result = driver({0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 0, 20, false)
      print(string.format("TEST-2...%s",result))
  
      result = driver({10, 2, 1, 34, 21, 37, 49, 31, 70, 97, 87, 50, 76, 55}, 0, 8, false)
      print(string.format("TEST-3...%s",result))
  
      result = driver({-94, -84, -82, -66, -64, -62, -56, -38, -24, -24, -4, 2, 4, 4, 8, 14, 16, 20, 30, 34, 34, 48, 58, 58, 70, 76, 78, 86, 88, 96, 98}, 0, 26, false)
      print(string.format("TEST-4...%s",result))
  
      result = driver({1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0}, 12, 11, true)
      print(string.format("TEST-5...%s",result))
  
      result = driver({5, 20, 30, 5, 10, 21, 5}, 0, 7, false)
      print(string.format("TEST-6...%s",result))
  
      result = driver({50, 20, 30, 5, 10, 21, 5}, 0, 7, true)
      print(string.format("TEST-7...%s",result))
  
      result = driver({50, 20, 30, 5, 10, 21, 5}, 2, 7, true)
      print(string.format("TEST-8...%s",result))
  
      result = driver({50, 20, 30, 5, 10, 21, 5}, 4, 7, true)
      print(string.format("TEST-9...%s",result))
  
  end
  
  main()
question_info.entry_cls_name: Solution
question_info.test_list: [{"idx": 0, "outputs": false, "inputs": {"arr": [1, 2, 3, 5, 24, 24, 25, 25, 36, 37, 37, 39, 42, 44, 46, 50, 51, 54, 56, 60, 62, 70, 71, 73, 75, 80, 80, 85, 86, 89, 91, 95, 99], "i": 0, "n": 18}}, {"idx": 1, "outputs": false, "inputs": {"arr": [-44, -58, 88, -42, 42, -14, -44, 42, 64, 94, -46, -70, 34, -10, -46, -52, -6, -78, 64, 56, 74, 98, -34, -4, -92, 6, -52, -20, 78, -72, -40], "i": 0, "n": 27}}, {"idx": 2, "outputs": false, "inputs": {"arr": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], "i": 0, "n": 20}}, {"idx": 3, "outputs": false, "inputs": {"arr": [10, 2, 1, 34, 21, 37, 49, 31, 70, 97, 87, 50, 76, 55], "i": 0, "n": 8}}, {"idx": 4, "outputs": false, "inputs": {"arr": [-94, -84, -82, -66, -64, -62, -56, -38, -24, -24, -4, 2, 4, 4, 8, 14, 16, 20, 30, 34, 34, 48, 58, 58, 70, 76, 78, 86, 88, 96, 98], "i": 0, "n": 26}}, {"idx": 5, "outputs": true, "inputs": {"arr": [1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0], "i": 12, "n": 11}}, {"idx": 6, "outputs": false, "inputs": {"arr": [5, 20, 30, 5, 10, 21, 5], "i": 0, "n": 7}}, {"idx": 7, "outputs": true, "inputs": {"arr": [50, 20, 30, 5, 10, 21, 5], "i": 0, "n": 7}}, {"idx": 8, "outputs": true, "inputs": {"arr": [50, 20, 30, 5, 10, 21, 5], "i": 2, "n": 7}}, {"idx": 9, "outputs": true, "inputs": {"arr": [50, 20, 30, 5, 10, 21, 5], "i": 4, "n": 7}}]
question_info.extension: lua
question_info.entry_fn_name: how_to_check_if_a_given_array_represents_a_binary_heap
question_info.test_case_ids: 0 1 2 3 4 5 6 7 8 9
question_info.commands: lua __FILENAME__