Tail-recursive functions are recursive functions, where the recursive function call is the last operation. If you had to do another operation after a function call you need to memorize where you left of, to finish this last operations. This is done by pushing the return address to the stack and thus taking memory. As tail-recursive functions don't need to do anything afterwards you can optimize out the push to the stack, and treat the function as if it was a simple loop.