Hacker News Reader

Wouldn't that make it (even more) trivial, since you can just traverse from the tail backwards? Assuming it has a tail pointer, of course.

Yeah, I suppose so. I only asked because reversing a singly-linked list just seems like a PitA.

Reversing a singly-linked list is actually easier: you take each element off the front of the old list and put it onto the front of the new list.