title: Height Complete Binary Tree Heap N Nodes
signature: function heightCompleteBinaryTreeHeapNNodes(n: number): number {
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.entry_cls_name: Solution
question_info.test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(n: number, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(65, 6);
    console.log(`TEST-0...${result}`);
  
    result = driver(94, 6);
    console.log(`TEST-1...${result}`);
  
    result = driver(52, 5);
    console.log(`TEST-2...${result}`);
  
    result = driver(31, 4);
    console.log(`TEST-3...${result}`);
  
    result = driver(9, 3);
    console.log(`TEST-4...${result}`);
  
    result = driver(1, 0);
    console.log(`TEST-5...${result}`);
  
    result = driver(41, 5);
    console.log(`TEST-6...${result}`);
  
    result = driver(98, 6);
    console.log(`TEST-7...${result}`);
  
    result = driver(45, 5);
    console.log(`TEST-8...${result}`);
  
    result = driver(24, 4);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
question_info.extension: ts
question_info.entry_fn_name: heightCompleteBinaryTreeHeapNNodes
question_info.test_case_ids: 0 1 2 3 4 5 6 7 8 9
question_info.commands: tsc --target es2020 --lib es5,dom,es2015,es2020 __FILENAME__
question_info.commands: node __FILENAME__.js