This never dawned on me before:
Typically ( as far as I know ) people handle linked-list copying by iterating the list, and pushing back the current dereferenced iterator ( at least that's how I've always done it ).
1) But doesn't that become O(logN)?
2) Wouldn't iterating the list once and pushing the front, then reversing the order be more efficient ( because isnt' that O( 2 * N )? )
3) Any other ways you can handle this more efficiently?
Thanks in advance,