Map Interface
- The Map interface does not extend collection interface.
- It uses key-value pairs.
Hash Map
- It is unsorted.
- it is unordered.
- It uses a hashing technique.
- It does not allow to add a key with a null value.
Hash Table
- It uses a Vector, hence it is synchronized.
- It is thread-safe.
- It is also unsorted an unordered.
- It allows to add key with null value.
Linked Hash Map
- Insertion order is maintained.
- It is sorted.
- It is slower in insertion and deletion with hash map.
- It has faster insertion.
- Faster in iteration.
Tree Map
- Data is stored in sorted order.
- It is a navigable set.