Talk:2483: Linked List Interview Problem
Revision as of 04:23, 1 July 2021 by 172.70.130.192 (talk)
Assuming not everyone understands O notation: O(1) means that it always takes the same time, no matter how much data is stored. O(n) means the time is proportional to the amount of data stored - if you have 10 times the data, it takes 10 times as long to find the one you want.
This code won't mail the linked list to a museum - it will mail the memory location of the head of the list to a museum.
