Why is it that linked lists are better when it comes to need

Why is it that linked lists are better when it comes to needing frequent add(), remove(), and get() operations?

Solution

1.Linked list permits the constant time insertions or removals with iterators.

2.The items are able to add or remove from the center of the list.

3.interpretating the starting size of an array is not needed.

4.insert and delete manipulations are simply accomplished in a linkedlist.

5.allocation and deallocation is possible at the time of programm running.

6.the main advantage of using linkedlist is reusing of current iterators to insert and delete element.