import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.TreeMap;

public class Sample {

  public static void main(String[] args) {
    Map<String, Integer> unsortedMap = new HashMap<>();
    unsortedMap.put("Banana", 1);
    unsortedMap.put("Apple", 2);
    unsortedMap.put("Orange", 3);

    // 오름차순 정렬
    Map<String, Integer> sortedMap = new TreeMap<>(unsortedMap);
    sortedMap.forEach((key, value) -> System.out.println(key + ": " + value));
    // Apple -> Banana -> Orange

    System.out.println();

    // 내림차순 정렬
    TreeMap<String, Integer> sortedMapDesc = new TreeMap<>(Comparator.reverseOrder());
    sortedMapDesc.putAll(unsortedMap);
    sortedMapDesc.forEach((key, value) -> System.out.println(key + ": " + value));
    // Orange -> Banana -> Apple
  }
}