Question

A developer is choosing between an array and a linked list to store a collection of elements. If the primary operations will be frequent insertions and deletions at arbitrary positions, and infrequent random access, which data structure is generally more suitable?

Q: Answer-A developer is choosing between an array and a linked list to store a collection of elements. If the...

Linked List Insertion and deletion at arbitrary positions once the position is found are O1 because only pointers need to be updated. However, random access finding an element at a specific index is ON as it requires traversing from the beginning. Array Insertion and deletion at arbitrary positions are ON because elements need to be shifted. Random access is O1. Given the emphasis on frequent insertionsdeletions at arbitrary positions and infrequent random access, a linked list is more suitable.