Assess students' ability to analyze and compare time and memory trade-offs among arrays, linked lists, hash tables, and binary search trees, including average and worst-case Big-O for access/search/insert/delete, memory overheads (pointers, resizing, buckets), effects of load factor and collision resolution, implications of balanced vs unbalanced BSTs, and choosing the most appropriate structure for given scenarios; include short explanations and scenario-based reasoning.