← Exit to Module 11: Collections Framework Deep Dive lessons
Module progress · 0%Lesson · 22 min
Module 11: Collections Framework Deep Dive
Lesson focusMap Implementations: HashMap, TreeMap, LinkedHashMap
Store key/value pairs with predictable performance and ordering.
01 · 14 minCollections Hierarchy OverviewLocked02 · 18 minList Implementations: ArrayList, LinkedList, VectorLocked03 · 20 minSet Implementations: HashSet, TreeSet, LinkedHashSetLocked04 · 22 minMap Implementations: HashMap, TreeMap, LinkedHashMapLocked05 · 16 minQueue & Deque ImplementationsLocked06 · 12 minComparable vs ComparatorLocked07 · 12 minCollections Utility ClassLocked08 · 14 minIteration Techniques & Fail-Fast BehaviorLocked09 · 35 minMini-Project: Contact Management SystemLocked
HashMap offers O(1) operations; default load factor 0.75 balances speed/memory.
LinkedHashMap maintains insertion or access order (useful for LRU caches).
TreeMap keeps keys sorted and provides navigational methods; key type must be Comparable or supply a Comparator.