TreeMap和HashMap的区别

最新推荐文章于 2025-08-25 15:50:22 发布

原创最新推荐文章于 2025-08-25 15:50:22 发布 · 259 阅读

0 ·

CC 4.0 BY-SA版权

JAVA语法专栏收录该内容

1 篇文章

订阅专栏

本文通过实例演示了Java中HashMap与TreeMap的区别，展示了两者在元素插入后的迭代顺序不同，HashMap依据哈希值进行存储不保证顺序，而TreeMap则会自动对键进行排序。

import java.util.Map;
import java.util.HashMap;
import java.util.TreeMap;
public class HashMapVsTreeMapExample
{
    public static void main(String args[])
    {
        /*------------HashMap implementation----------------*/
        Map<Integer, String> hm=new HashMap<Integer, String>();
//adding elements to the HashMap
        hm.put(9, "Red");
        hm.put(12, "Black");
        hm.put(6, "Green");
        hm.put(19, "White");
        System.out.println("HashMap iteration Order:");
//iteration over map using for each loop
        for(Map.Entry<Integer, String>entry: hm.entrySet())
        {
//getting keys and values using method
            System.out.println(entry.getKey() + " = " +entry.getValue());
        }
        /*------------TreeMap implementation----------------*/
        Map<Integer, String> tm=new TreeMap<Integer, String>();
//adding elements to the TreeMap
        tm.put(9, "Red");
        tm.put(12, "Black");
        tm.put(6, "Green");
        tm.put(19, "White");
        System.out.println("TreeMap iteration Order:");
        //iteration over map using for each loop
        for(Map.Entry<Integer, String>entry: tm.entrySet())
        {
//getting keys and values using method
//prints list in sorted order
            System.out.println(entry.getKey() + " = " +entry.getValue());
        }
    }
}

运行结果：

HashMap iteration Order:
19 = White
6 = Green
9 = Red
12 = Black
TreeMap iteration Order:
6 = Green
9 = Red
12 = Black
19 = White