TreeMap排序的排序器应用

@Test
public void test11() {
    //不指定排序器
    TreeMap<String, String> treeMap1 = new TreeMap<String, String>();
    treeMap1.put("2", "1");
    treeMap1.put("b", "2");
    treeMap1.put("1", "3");
    treeMap1.put("a", "4");
    System.out.println("treeMap1=" + treeMap1);//treeMap1={1=3, 2=1, a=4, b=2}

    //指定排序器
    TreeMap<String, String> treeMap2 = new TreeMap<String, String>((String o1, String o2) -> o2.compareTo(o1));
    treeMap2.put("2", "1");
    treeMap2.put("b", "2");
    treeMap2.put("1", "3");
    treeMap2.put("a", "4");
    System.out.println("treeMap2=" + treeMap2);//treeMap2={b=2, a=4, 2=1, 1=3}
}

上面是正序(递增,也是默认的排序),下面应用了排序器是倒序,这里用了java8不知道不了解的能不能看懂