Now that totally changes if you're writing Scheme...
Anyway, it is worthwhile to practice writing recursive solutions (beginning with Scheme) to understand possible pitfalls in case of non-tail recursion, and then, proudly, switch to fixed-space looping techniques.)
* some platforms don't provide useful support (in the History it were some stack-oriented Lisp Machines, nowadays it is the JVM - see ABCL)
* there is no consensus how it should be invoked, how its effect should be reported by a compiler, how the user should be noted about limitations (example: LispWorks limits the number of variables), ...
* it is not a good fit with Common Lisp, since the language supports all kinds of dynamic constructs: dynamic binding, unwind-protect, ... It is not clear how this should interoperate with TCO in CL.
* it makes debugging more diffcult (backtraces, trace, ...)
Pascal Costanza has an interesting opinion[1] on why TCO wasn't included in the ANSI standard.
PAIP is one of the best books about programming ever. Generally loops are preferred over recursion in CL - it is not Scheme.
'Piratebay' pays also for the Lisp authors and encourages them to write books? Wonderful, let us know how it works.
HtDP should go before SICP. HtDP2 is a much better reading than old HtDP. In both books exercises must be done.
PAIP is a decent reading, but mr. Norvig, it seems, dislikes macros and recursion and prefers strictures and loops.)
btw, all the books are "available" on piratebay, if you are not too strict or american.)