>actions trump asymptotic complexity Which operation of a linked list has any better complexity. The only one I can think of is a frequent removal of random el

>actions trump asymptotic complexity Which operation of a linked list has any better complexity. The only one I can think of is a frequent removal of random elements in the middle -- and opt not to use tombstones.