input: Write a python function to find the square root of a number using binary search.
  assert binarySearch(16, 0, 16) == 4
  assert binarySearch(25, 0, 25) == 5
  assert binarySearch(49, 0, 49) == 7
output: def binarySearch(n, low, high):
      if n < 0:
          raise ValueError("Cannot compute square root of a negative number")
  
      if n == 0 or n == 1:
          return n
  
      while low <= high:
          mid = (low + high) // 2
          mid_squared = mid * mid
  
          if mid_squared == n:
              return mid
          elif mid_squared < n:
              low = mid + 1
              ans = mid
          else:
              high = mid - 1
  
      return ans