Sorted Map Interface Example Java Program


Sorted Map Interface defines a map that's sorted by the keys provided. Using, once again, the compareTo() method or a method provided in the constructor to the sorted map, the key-element pairs are sorted by the keys. The first and last keys on the map can be called. Additionally, submaps can be created from the minimum and maximum keys. SortedMap is implemented by TreeMap.


SortedMap<key-variable-type, value-variable-type> variable-name= new TreeMap<key-variable-type, value-variable-type>();

Example Program

import java.util.Map;
import java.util.SortedMap;
import java.util.TreeMap;

public class SortedMapInterfaceExample {

    public static void main(String[] args) {
        SortedMap<String, String> sortedMap = new TreeMap<String, String>();
        sortedMap.put("One", "NORTH");
        sortedMap.put("Two", "SOUTH");
        sortedMap.put("Three", "EAST");
        sortedMap.put("Four", "WEST");
        for (Map.Entry map : sortedMap.entrySet()) {
            System.out.println("Key is : " + map.getKey() + " and Value is : " + map.getValue());

Sample Output

Key is : Four and Value is : WEST
Key is : One and Value is : NORTH
Key is : Three and Value is : EAST
Key is : Two and Value is : SOUTH