HashMap和TreeMap的区别

public  class Test {

   public    static  void main(String[] args){
      String[] arg={"DA","AB","CC","BD"};
       Map map1=new TreeMap();
       Map map2=new HashMap();
       tryCa(map1,arg);
       tryCa(map2,arg);
       Iterator<Map.Entry<Object,Object>> it2=map1.entrySet().iterator();
       while (it2.hasNext()){
           Map.Entry<Object,Object> m=it2.next();
           System.out.print(m.getKey()+"-"+m.getValue());
           System.out.print(",");
       }
       System.out.println();
      Iterator<Map.Entry<Object,Object>> it5=map2.entrySet().iterator();
       while (it5.hasNext()){
           Map.Entry<Object,Object> m2=it5.next();
           System.out.print(m2.getKey()+"-"+m2.getValue());System.out.print(",");

       }

   }
    public    static Map tryCa( Map map,String[] arg ){
       for(int i=0;i<arg.length;i++){
           map.put(arg[i],i);
       }
       return map;
    }
}

运行结果
AB-1,BD-3,CC-2,DA-0,
CC-2,AB-1,BD-3,DA-0,
总结：
1、treeMap会自动根据map的key值排序，hashMap乱序
2、treeMap，hashMap非线程安全
3、Hashtable线程安全，无序列