Java中HashMap LinkedHashMap TreeMap的对比

HashMap<Integer,String> hashMap = new HashMap<>();
        hashMap.put(11,"a");
        hashMap.put(12,"c");
        hashMap.put(13,"b");
        hashMap.put(6,"d");
        hashMap.put(100,"e");
        hashMap.put(5,"f");

        System.out.println("HashMap");
        Iterator<Map.Entry<Integer,String>> iterator = hashMap.entrySet().iterator();
        while(iterator.hasNext()){
            Map.Entry<Integer,String> entry = iterator.next();
            System.out.println("key:" + entry.getKey() + " value:"+entry.getValue());
        }

        System.out.println("\nLinkedHashMap");
        LinkedHashMap<Integer,String> linkedHashMap = new LinkedHashMap<>();
        linkedHashMap.put(11,"a");
        linkedHashMap.put(12,"c");
        linkedHashMap.put(13,"b");
        linkedHashMap.put(6,"d");
        linkedHashMap.put(100,"e");
        linkedHashMap.put(5,"f");

        Iterator<Map.Entry<Integer,String>> iterator2 = linkedHashMap.entrySet().iterator();
        while(iterator2.hasNext()){
            Map.Entry<Integer,String> entry = iterator2.next();
            System.out.println("key:" + entry.getKey() + " value:"+entry.getValue());
        }

        System.out.println("\nTreeMap");
        TreeMap<Integer,String> treeMap = new TreeMap<>();
        treeMap.put(11,"a");
        treeMap.put(12,"c");
        treeMap.put(13,"b");
        treeMap.put(6,"d");
        treeMap.put(100,"e");
        treeMap.put(5,"f");

        Iterator<Map.Entry<Integer,String>> iterator3 = treeMap.entrySet().iterator();
        while(iterator3.hasNext()){
            Map.Entry<Integer,String> entry = iterator3.next();
            System.out.println("key:" + entry.getKey() + " value:"+entry.getValue());
        }


        System.out.println("\nTreeMap(自定义Comparator(key))");
        TreeMap<Integer,String> treeMap2 = new TreeMap<>(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                int result = o1 - o2;
                if(result > 0){
                    return -1;
                }else if(result < 0){
                    return 1;
                }
                return 0;
            }
        });
        treeMap2.put(11,"a");
        treeMap2.put(12,"c");
        treeMap2.put(13,"b");
        treeMap2.put(6,"d");
        treeMap2.put(100,"e");
        treeMap2.put(5,"f");

        Iterator<Map.Entry<Integer,String>> iterator4 = treeMap2.entrySet().iterator();
        while(iterator4.hasNext()){
            Map.Entry<Integer,String> entry = iterator4.next();
            System.out.println("key:" + entry.getKey() + " value:"+entry.getValue());
        }

HashMap
key:100 value:e
key:5 value:f
key:6 value:d
key:11 value:a
key:12 value:c
key:13 value:b

LinkedHashMap
key:11 value:a
key:12 value:c
key:13 value:b
key:6 value:d
key:100 value:e
key:5 value:f

TreeMap
key:5 value:f
key:6 value:d
key:11 value:a
key:12 value:c
key:13 value:b
key:100 value:e

TreeMap(自定义Comparator(key))
key:100 value:e
key:13 value:b
key:12 value:c
key:11 value:a
key:6 value:d
key:5 value:f