4.3. Working with Maps – Beyond the Basics

NavigableMap<Integer, String> map = new TreeMap<>();
map.put(10, "A"); map.put(20, "B"); map.put(30, "C");
System.out.println(map.ceilingEntry(15)); // Entry >= 15
System.out.println(map.floorEntry(25)); // Entry <= 25

Provides sorted views, range queries (subMap, headMap, tailMap).

A TreeMap in Java is a collection that maintains its elements in a sorted order. When we create a TreeMap, we can add key-value pairs, like integers paired with strings. The ceilingEntry method retrieves the smallest key that is greater than or equal to a specified key (in this case, 15), while the floorEntry method retrieves the largest key that is less than or equal to a specified key (in this case, 25). This sorted organization facilitates efficient queries spanning certain ranges, such as obtaining a subset of this map between certain keys using methods like subMap, headMap, or tailMap.

Think of a TreeMap like an organized pile of books on a shelf, where each book is sorted by title. If you're looking for a book with a title that starts with 'C', you can quickly find the closest one without searching through every book because they are all in order. Similarly, with TreeMap methods, you can quickly find where certain entries fall in the sorted order.

This table highlights some key differences among three popular Java Map implementations: HashMap, LinkedHashMap, and TreeMap. A HashMap does not maintain any order of its elements and is optimized for performance, offering high efficiency for insertions and lookups. A LinkedHashMap maintains the order of insertion, meaning elements will appear in the order they were added. This can be useful when ordering is important. A TreeMap sorts its elements based on the natural ordering of its keys (or by a custom comparator), which makes it slower in terms of performance due to its underlying red-black tree structure. Also, it's important to note that only HashMap and LinkedHashMap allow null keys, while TreeMap will throw an error if attempted.

Imagine you have three different filing systems for organizing your documents. A HashMap is like a chaotic drawer where you toss papers randomly. You can find documents quickly, but they're not in any order. A LinkedHashMap is like a filing cabinet where documents are placed one after another, keeping the order you put them in. Finally, a TreeMap is like a library sorted alphabetically by title, allowing you to find items based on a specific order, but it may take longer to organize when you add new documents.

--