Are you sure you're getting this? Fill in the missing part by typing it in.

In tail recursion, the calculations are done upfront, with the result passed as an argument to the recursive call. This allows the system to discard old stack frames as new ones are created, effectively performing a '_' operation instead of a 'push', significantly reducing the risk of a stack overflow.