Describe all the common data structures.
Asked in the hiring manager / panel interview stage. Implement a function that returns a concise reference entry for each requested structure.
names is a list of unique lowercase names from the supported set: array, linked_list, stack, queue, hash_map, set, binary_search_tree, heap, and graph. Return a list in the same order. Each entry must contain name, purpose, typical_operations, and tradeoff, where typical_operations is a dictionary of operation names to average Big O strings.
def describe_data_structures(names):