Code generated with tail-call optimization is, in fact, literally a loop.
The recursive version of Fibonacci is generally not tail recursive, but f(n) = f(n - 1) + f(n - 2).
It's easy enough to convert by adding arguments for the two variables used in the iterative version:
The point of recursion is not recursion, but a better way to write code. Better can be more readable, less errors, whatever, but adding two parameters to the Fibonacci function for the sake of introducing tail recursion, where even iteration is more understandable, is pointless.
Tree- and graph traversal is often easier to reason about using recursion from my experience.
Worst case, you can get the same effect by pushing recursive calls on a stack/queue that's consumed iteratively.