Tail Recursion, why it's efficent?

Question

I was watching: https://www.youtube.com/watch?v=_JtPhF8MshA

Where the following implementation:

int factorial (int n)
{
    if (n==0) return 1;
    return