Solution: Pow(x, n)

Explore how to implement a function that calculates x raised to the power n efficiently using binary exponentiation. Understand how to reduce recursive calls by halving the exponent, handle negative exponents by using reciprocals, and analyze the time and space complexity of the approach to optimize performance.