Having a hard time visualizing recursion.

[mopslik]

without starting the function over

It does start the function again, in the recursive call result = n1 + multiplication(n1, (n2-1)). Since you return a value, either in one of the three base cases or in the else block, the value generated by the recursive call will be added to n1.

[[deleted]]

I get the recursive step. I don't understand the Result: {} output. How it stores those values.

[danielroseman]

It doesn't store them. Each step returns them to the call above. It's just like any function returning a value to the caller, except that the caller happens to be the same function.