In which cases is it better to choose a linked list implementation over other data structures?

A linked list is preferable in the following cases:

• When frequent addition and removal of elements in the middle of the collection are required, as insertion and deletion operations in a linked list are faster than in an array, without the need to shift elements.
• When the size of the collection changes dynamically and is unknown in advance.
• If memory conservation is important when working with large volumes of data, as a linked list does not require allocating a contiguous block of memory.

However, it should be noted that access to elements by index in a linked list is slower than in an array, as it requires sequential traversal.