title: Height Complete Binary Tree Heap N Nodes
signature: heightCompleteBinaryTreeHeapNNodes :: Integer -> Integer
  heightCompleteBinaryTreeHeapNNodes n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      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) )
  
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;
  }