CS61A - Spring 2013 - Tail Recursion
First off, I think this is an excellent article to read about tail recursion and tail calls in Python: here
Basically, you can write tail recursive functions in any language. Tail recursion, in one sentence, is where you return the answer in the final frame instead of following the frames back up to the original frame. For example, we have factorial which is normally not tail recursive: (Read More!)
Looks like there currently aren't any practice problems (yet) about Tail Recursion...if you'd like to see some, let me know.