while space complexity represents the amount of memory space an algorithm requires. Big O notation is a standardized way to express and compare these complexities.
For Fibonacci Sequence, the space complexity should be the O(logN), which is the height of tree. Check thesource