Even if inserting in the beginning can be faster, ...

# announcements

[orangy]

Even if inserting in the beginning can be faster, it’s not the whole story. Since you can’t randomly access linked list (in good time), you are probably doing something like queue or deque. Which can better be implemented with something like round buffer, without all the issues of LinkedList