title: Height Complete Binary Tree Heap N Nodes
signature: function heightCompleteBinaryTreeHeapNNodes($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        65, 
        6));
      
      printf("TEST-1...%s\n",driver(
        94, 
        6));
      
      printf("TEST-2...%s\n",driver(
        52, 
        5));
      
      printf("TEST-3...%s\n",driver(
        31, 
        4));
      
      printf("TEST-4...%s\n",driver(
        9, 
        3));
      
      printf("TEST-5...%s\n",driver(
        1, 
        0));
      
      printf("TEST-6...%s\n",driver(
        41, 
        5));
      
      printf("TEST-7...%s\n",driver(
        98, 
        6));
      
      printf("TEST-8...%s\n",driver(
        45, 
        5));
      
      printf("TEST-9...%s\n",driver(
        24, 
        4));
      
  }
  
  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;
  }