In the complexity analysis, it says that you can add a new node after last node of a singly linked list in O(1) time. Could someone clarify how that is the case? Don't we have to touch every node in the LinkedList at least once, in O(N) time, to find the last node first?