title: Height Complete Binary Tree Heap N Nodes
signature: fun heightCompleteBinaryTreeHeapNNodes(n: Int): Int {
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;
  }
question_info.test_list: [{"idx": 0, "outputs": 6, "inputs": {"n": 65}}, {"idx": 1, "outputs": 6, "inputs": {"n": 94}}, {"idx": 2, "outputs": 5, "inputs": {"n": 52}}, {"idx": 3, "outputs": 4, "inputs": {"n": 31}}, {"idx": 4, "outputs": 3, "inputs": {"n": 9}}, {"idx": 5, "outputs": 0, "inputs": {"n": 1}}, {"idx": 6, "outputs": 5, "inputs": {"n": 41}}, {"idx": 7, "outputs": 6, "inputs": {"n": 98}}, {"idx": 8, "outputs": 5, "inputs": {"n": 45}}, {"idx": 9, "outputs": 4, "inputs": {"n": 24}}]
question_info.extension: kts
question_info.test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(n: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(65, 6)
      println("TEST-0...${result}")
      
      result = driver(94, 6)
      println("TEST-1...${result}")
      
      result = driver(52, 5)
      println("TEST-2...${result}")
      
      result = driver(31, 4)
      println("TEST-3...${result}")
      
      result = driver(9, 3)
      println("TEST-4...${result}")
      
      result = driver(1, 0)
      println("TEST-5...${result}")
      
      result = driver(41, 5)
      println("TEST-6...${result}")
      
      result = driver(98, 6)
      println("TEST-7...${result}")
      
      result = driver(45, 5)
      println("TEST-8...${result}")
      
      result = driver(24, 4)
      println("TEST-9...${result}")
      
          
  }
  
  main()
question_info.entry_fn_name: heightCompleteBinaryTreeHeapNNodes
question_info.entry_cls_name: Solution
question_info.test_case_ids: 0 1 2 3 4 5 6 7 8 9
question_info.commands: kotlinc -script __FILENAME__ -no-reflect -nowarn