What are the advantages and disadvantages of the LinkedList data structure?

Advantages of LinkedList:

• Fast insertion and deletion of elements in the middle of the list, as there is no need to shift elements, just reassign links.
• Suitable for cases where you often need to add or remove elements at the beginning or middle of the collection.

Disadvantages of LinkedList:

• Slow access by index (O(n)), as you need to traverse elements sequentially from the beginning or end.
• Higher memory consumption due to storing additional references to the previous and next elements.
• Worse cache performance compared to ArrayList, as elements are not stored contiguously in memory.

Example usage:

LinkedList<String> list = new LinkedList<>();
list.add("A");
list.addFirst("B");
list.removeLast();