Assess students' ability to analyze and compare time and space complexity trade-offs and practical performance of hash tables, binary search trees (balanced and unbalanced), and skip lists for search, insert, and delete operations; include interpretation of average vs worst-case behaviors, memory usage and constant factors, and scenario-based questions asking for the best structure given workload characteristics (e.g., adversarial keys, ordered input, memory limits, concurrency/rehashing concerns).