Matching a Structure to the Operation

Each data structure is good at some operations and poor at others. For direct access by index, an array is the best fit. For repeated insertion or deletion at the front or middle, a linked list is the best fit. For fast lookup by key, a hash table is the best fit. Choosing the right structure means matching it to the operation you need.