title: Height Complete Binary Tree Heap N Nodes
signature: func heightCompleteBinaryTreeHeapNNodes(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(65, 6)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(94, 6)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(52, 5)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(31, 4)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(9, 3)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(1, 0)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(41, 5)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(98, 6)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(45, 5)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(24, 4)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }