Java treemap sort by value

Let’s learn java treemap sort by value.

Java treemap sort by value

To sort a treemap by value we have to build some logic using comparator. Here’s an example,

import java.util.Comparator;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;
public class TreeMapByValue 
   public static <K, V extends Comparable<V>> Map<K, V> sortValues(final Map<K, V> m) 
      Comparator<K> com = new Comparator<K>()
         public int compare(K k1, K k2) 
            int compare = m.get(k1).compareTo(m.get(k2));
            if(compare == 0)
               return 1;
               return compare;
      Map<K, V> sortedByValues = new TreeMap<K, V>(com);
      return sortedByValues;
   public static void main(String[] args) 
      TreeMap<String, String> fruits = new TreeMap<String, String>();
      fruits.put("K1", "Jackfruit");
      fruits.put("K2", "Raspberry");
      fruits.put("K3", "Kiwifruit");
      fruits.put("K4", "Tangerine");
      fruits.put("K5", "Strawberry");
      // calling sortvalues method
      Map<String, String> sortedMap = sortValues(fruits);
      Set set = sortedMap.entrySet();
      Iterator iterate = set.iterator();
      // print elements
         Map.Entry ma = (Map.Entry);
         System.out.print(ma.getKey() + ": ");


K1: Jackfruit
K3: Kiwifruit
K2: Raspberry
K5: Strawberry
K4: Tangerine

Also read – major features of java