Question: What is the space complexity of a recursive function that uses O(n) space for its call stack?

Options:

1. O(1)
2. O(n)
3. O(n^2)
4. O(log n)

Correct Answer: O(n)

Solution:

The space complexity of a recursive function that uses O(n) space for its call stack is O(n).