title: Height Complete Binary Tree Heap N Nodes
signature: function height_complete_binary_tree_heap_n_nodes(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(65, 6);
      @printf("TEST-0...%s\n",result);
      
      result = driver(94, 6);
      @printf("TEST-1...%s\n",result);
      
      result = driver(52, 5);
      @printf("TEST-2...%s\n",result);
      
      result = driver(31, 4);
      @printf("TEST-3...%s\n",result);
      
      result = driver(9, 3);
      @printf("TEST-4...%s\n",result);
      
      result = driver(1, 0);
      @printf("TEST-5...%s\n",result);
      
      result = driver(41, 5);
      @printf("TEST-6...%s\n",result);
      
      result = driver(98, 6);
      @printf("TEST-7...%s\n",result);
      
      result = driver(45, 5);
      @printf("TEST-8...%s\n",result);
      
      result = driver(24, 4);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def height_complete_binary_tree_heap_n_nodes(N):
      return (math.ceil(math.log2((N + 1))) - 1)
source_cpp: int height_complete_binary_tree_heap_n_nodes(int N) {
    return ceil ( log2 ( N + 1 ) ) - 1;
  }