Java: Sort keys in Tree Map by using comparator

Last update on December 21 2024 09:56:47 (UTC/GMT +8 hours)

Write a Java program to sort keys in a Tree Map by using a comparator.

Sample Solution:-

Java Code:

import java.util.*;
import java.util.Map.Entry;  
public class Example7 {  
    public static void main(String args[]){  
  TreeMap<String,String> tree_map1 = new TreeMap<String,String>(new sort_key());
   // Put elements to the map 
  tree_map1.put("C2", "Red");
  tree_map1.put("C4", "Green");
  tree_map1.put("C3", "Black");
  tree_map1.put("C1", "White"); 
  System.out.println(tree_map1); 
    }
}
 class sort_key implements Comparator<String>{
     @Override
    public int compare(String str1, String str2) {
        return str1.compareTo(str2);
    }
     
}

Sample Output:

{C1=White, C2=Red, C3=Black, C4=Green} 

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Delete all elements from a given Tree Map.
Next: Get a key-value mapping associated with the greatest key and the least key in a map.