title: Height Complete Binary Tree Heap N Nodes
signature: class Solution {
  
      public Integer heightCompleteBinaryTreeHeapNNodes(Integer n) {
test_code: import static java.util.Map.entry;  
  import java.util.*;
  import java.lang.*;
  // TESTING CODE 
  // ============================================
  class QuestionEvaluator {
      public static String validateSolution(Integer n, Integer expected){
          try{
              Driver driver = new Driver();
              if (driver.run(n,expected)){
                  return "PASSED";
              }
              return "FAILED";
              
          } catch (Exception exception_obj){
              return exception_obj.getClass().getSimpleName();
          }
  
      }
      public static void main(String[] args) {
          String result;
          result = validateSolution(65, 6);
          System.out.println(String.format("%s%s","TEST-0...",result));    
      
          result = validateSolution(94, 6);
          System.out.println(String.format("%s%s","TEST-1...",result));    
      
          result = validateSolution(52, 5);
          System.out.println(String.format("%s%s","TEST-2...",result));    
      
          result = validateSolution(31, 4);
          System.out.println(String.format("%s%s","TEST-3...",result));    
      
          result = validateSolution(9, 3);
          System.out.println(String.format("%s%s","TEST-4...",result));    
      
          result = validateSolution(1, 0);
          System.out.println(String.format("%s%s","TEST-5...",result));    
      
          result = validateSolution(41, 5);
          System.out.println(String.format("%s%s","TEST-6...",result));    
      
          result = validateSolution(98, 6);
          System.out.println(String.format("%s%s","TEST-7...",result));    
      
          result = validateSolution(45, 5);
          System.out.println(String.format("%s%s","TEST-8...",result));    
      
          result = validateSolution(24, 4);
          System.out.println(String.format("%s%s","TEST-9...",result));    
      
      }
  }
  
  class Driver{
      public boolean run(Integer n, Integer expected){
  
          PLACEHOLDER_CLS_NAME sol = new PLACEHOLDER_CLS_NAME();
          return validateSolution(sol.PLACEHOLDER_FN_NAME(n),expected);
      }
      
      public boolean validateSolution(Integer actual, Integer expected){
          return actual.equals(expected);
      }
  }
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
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;
  }