title: Time complexity of linked list traversal in two passes
body: <p>I know that traversing a linked list from head to tail takes O(n) time. What if we traverse it twice? Is it still O(n), correct? Because I'm basically O(n + n) = O(2n) ~ O(n).</p>