Recursively traverse linked list -- help!

[Paul Rubin]

"Mike Carifio" <carifio.nospam at nospam.usys.com> writes:
> # simple is good too
> 
> def traverse(list):
>     if list:
>         print list[0]  # or do something here
>         traverse(list[1:])
>     else:
>         print "done"
> 
> # even simplier
> 
> def traverse1(list):
>     if list:
>         # do something
>         traverse(list[1:])

That's ok in Scheme but I don't think any current Python implementations
handle tail recursion "correctly".