Evaluate learners' ability to analyze and compare time and space trade-offs among arrays, linked lists, hash tables, heaps, and binary search trees. Scope includes operation costs (access, search, insert, delete), average vs worst-case and amortized complexity, memory overhead and cache locality, resizing/balancing and collision-handling strategies, and justification of structure choice for given data sizes and use-cases.