00:01
Okay, so i see that you need help with this question.
00:03
Why might an array be preferred to the linked list data structure? so it is easier to add and remove data.
00:12
Arrays have a fixed size, so adding or removing elements from arrays requires a shift of all subsequent elements.
00:21
On the other hand, linked list can easily add or remove elements by simply updating the pointers.
00:27
Therefore, linked lists are preferred when frequent insertion or deletions are required.
00:36
It is easier to implement extensive abstract data structures.
00:43
Arrays have a fixed size, so if the size needs to be increased, a new array with a larger size needs to be created.
00:54
And all elements need to be copied to the new array.
00:59
In contrast, linked lists can easily grow or shrink in size by simply updating the pointers.
01:06
Therefore, linked lists are preferred when the size and data structure needs to be dynamically changed.
01:15
References to systems can be known without inspecting elements...