Based on this graph, map I assume the space complexity for fibonacci recursion function in big O notation is O(n)?

Well, my understanding about space complexity is that the depth of recrusion the function created, is this right? By the way, in what circumstances that space complexity is going to be larger than time complexity?

f(n) : fibonacci(n) {(5) f(4) f(3) f(2) f(2) f(1) f(2) f(1) f(1) f(0) f(1) f(0) f(1) f(0) Recursion tree generated for computing 5th number of fibonacci sequence