ConceptSystems & CS
Tree recursion space complexity
The space complexity of the recursive Fibonacci process grows linearly with n, corresponding to the maximum depth of the recursion tree.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.