Your question is Compare Data Structures Complexity. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Compare the Big-O time complexity of common operations for hash maps, lists, and binary trees, and explain when you would choose each.