Quiz on Tail Recursion in DSA

What is tail recursion?

Why is tail recursion considered better than regular recursion in some cases?

Which of the following is true about a tail-recursive function?

In tail recursion, the result of the function is usually:

Which of the following is not a benefit of tail recursion?

function factorial(n, result = 1) {
if (n == 0) return result;
return factorial(n – 1, n * result);
}

In tail recursion, how is the recursive call different from normal recursion?

What is required for a compiler to optimize tail-recursive functions?

Which of the following can be converted into a tail-recursive version?

Which of these is an example use case of tail recursion?