Assess students' ability to analyze time-space trade-offs between hash tables and balanced binary search trees for dynamic datasets. Require comparison of average and worst-case time complexities for lookup, insertion, and deletion; evaluation of collision-resolution techniques (chaining, open addressing) and their effects on performance and memory; analysis of rebalancing costs and amortized resizing; and scenario-based justification of which structure best fits specific workload patterns and constraints. Expect clear complexity bounds, memory estimates, and reasoned recommendations.