Beginner
Data Structures & Algorithms
Q10 / 100
What is the space complexity of a recursive function that calls itself n times?
Correct! Well done.
Incorrect.
The correct answer is C) O(n)
C
Correct Answer
O(n)
Explanation
Each recursive call adds a stack frame, so n recursive calls consume O(n) stack space.
Progress
10/100