That example involves inserting (and deleting) elements at a specific index, which means you would have to traverse (on average) half of the linked-list each ti

That example involves inserting (and deleting) elements at a specific index, which means you would have to traverse (on average) half of the linked-list each time. Generally, when I work with linked-lists (excluding functional programming) I only delete elements after I already have a pointer to them for something else. Similarly, I generally do not care about the order of elements, so I can either insert a new element at whatever index my cursor happens to be at, or append them to the end.