It requires $O(1)$ auxiliary space.

The recursive call is the final action in the function.

It requires $O(n)$ space on the call stack due to deferred operations.

It is always more efficient than an iterative implementation.