The main difference is not that it affects memory usage, imo.

It’s that it makes memory usage bounded when it’s on, and unbounded when it’s off.

In languages that have guaranteed tail call eliminations, the semantics of tail recursion is the same as that of a loop. So you can express the same iterative algorithm without using iterative code.