<\/span><\/h3>\n\nTo sort a TreeMap by value, we need to create a custom comparator that sorts entries based on their values. Here’s an example code snippet that demonstrates the process:<\/p>\n
“`java
\nimport java.util.*;<\/p>\n
public class ValueComparator implements Comparator {
\n Map map;<\/p>\n public ValueComparator(Map map) {
\n this.map = map;
\n }<\/p>\n public int compare(String a, String b) {
\n if (map.get(a) >= map.get(b)) {
\n return 1;
\n } else {
\n return -1;
\n }
\n }
\n}<\/p>\n
public class TreeMapSortByValueExample {
\n public static void main(String[] args) {
\n Map map = new TreeMap();<\/p>\n \/\/ Populate the TreeMap with key-value pairs<\/p>\n
\/\/ Create a custom comparator instance
\n ValueComparator comparator = new ValueComparator(map);<\/p>\n
\/\/ Sort the TreeMap by values using the custom comparator
\n Map sortedByValue = new TreeMap(comparator);
\n sortedByValue.putAll(map);<\/p>\n \/\/ Display the sorted TreeMap
\n for (Map.Entry entry : sortedByValue.entrySet()) {
\n System.out.println(entry.getKey() + ” : ” + entry.getValue());
\n }
\n }
\n}
\n“`<\/p>\n**By creating a custom comparator and using it while initializing a new TreeMap, we can effectively sort the TreeMap by its values in ascending order.**<\/p>\n