HashMap vs TreeMap vs LinkedHashMap
HashMap: expected O(1) get/put; no general sorted iteration guarantee.
LinkedHashMap: expected O(1) get/put; maintains insertion order, and can also be configured for access order.
TreeMap: O(log n) get/put/remove; maintains keys in sorted order.
HashMap is usually preferred for pure key-based lookup.
TreeMap is appropriate for range queries, sorted traversal, and predecessor/successor operations.
LinkedHashMap is useful when deterministic iteration order is required.