I feel confused a little bit about linked list

Although it is more expensive computationally, sometimes it is the best solution to manage the data you have to manage.

In the same way that a plane takes more fuel to use than a car, but sometimes the journey you are taking requires the use of a plane. If for instance you are traversing a set of islands, and taking the car would involve 10 separate ferry journeys as well as the driving, a plane would end up as the most efficient form of travel. In code that analogy might translate as using the less efficient LinkedList, instead of using reference arrays or some other way of maintaining the links between the data in the more efficient Lists.

Hope this helps

Hi

I re-read my answer and I guess it doesn't help much.

Below I have pasted the transcript from Pasan's video with the relevant statements which answer your question. This might be a better answer.

Arrays are particularly good at accessing and reading values which happens in constant time. But arrays are pretty bad at inserting and deleting, both of which run in linear time. Linked lists, on the hand, are somewhat better at this, although there are some caveats. And if we're trying to solve a problem that involves far more inserts and deletes than accessing, a linked list can be a better tool than an array.

Hope this helps more than the last answer did

One benefit of inserting and deleting with Linked Lists is that the Linked Lists are not stored continuously in memory, like Arrays -- Arrays need to be resized after enough insertions and deletions whereas Linked Lists do not.