Skip to content

Maps in Java

A Map represents an object that maps unique keys to values. A Map cannot contain duplicate keys; each key can map to at most one value. Unlike the other collection interfaces (List, Set, Queue), Map does not inherit from Collection or Iterable.


Implementing Classes Map

1. HashMap (Unordered, Default Choice)

2. LinkedHashMap (Preserves Insertion/Access Order)

3. TreeMap (Sorted Key Ordering)

4. Hashtable (Thread-safe monitor lock, Obsolete)


Map Implementations Summary

graph TD
    Map["Map Interface"]
    HashMap["HashMap (Hashing, Unordered)"]
    LinkedHashMap["LinkedHashMap (Doubly Linked, Insertion/Access Order)"]
    SortedMap["SortedMap Interface"]
    TreeMap["TreeMap (Red-Black Tree, Sorted Keys)"]
    Hashtable["Hashtable (Synchronized, Legacy)"]

    Map --> HashMap
    HashMap --> LinkedHashMap
    Map --> SortedMap
    SortedMap --> TreeMap
    Map --> Hashtable

Back to Module Home: Collection Framework Index