JonTheBaller
Golden Member
Write a function that returns the nth element from the right in a singly-linked, forward-linked linked list. And no you can't go to the end, count the size, and start over. Basically you can traverse once through but you can't start over at the first node. I think I know how to do this recursively, but how would you do it in a while loop?
