Recursion function in Python

Question

Consider this basic recursion in Python:

def fibonacci(number):
    if number == 0: return 0
    elif number == 1:
        return 1
    else:
        return          


        

Answer 1

does the 'finobacci(number-1)' completes all the recursion until it reaches '1' and then it does the same with 'fibonacci(number-2)' and add them?

Yes, that's exactly right. In other words, the following

return fibonacci(number-1) + fibonacci(number-2)

is equivalent to

f1 = fibonacci(number-1)
f2 = fibonacci(number-2)
return f1 + f2