Talk:Search data structure
Appearance
I don't see how a sorted linked list has an insertion efficiency of O(1). Don't you have to find where to insert it? I think it's O(n).
As a corollary, deletion would also be O(n). Must traverse the list to find the item. Trigger hurt (talk)