排序技术之后是TreeMap？

Question

当我们尝试打印存储在其中的数据时，谁能解释一下如何在TreeMap自动对数据进行排序？

Answer 1

They aren't; TreeMap uses a red-black tree to manage the data, and this tree implicitly keeps the data sorted. All that the iterator has to do is to traverse the nodes.

Answer 2

物品已经排序-通过使用红黑树在内部存储物品来实现。

Answer 3

If the TreeMap stores objects that implement the Comparable interface (and String does) than it uses the .compareTo method to compare individual Strings and determine the sort order.

On the other hand you can provide a Comparator when constructing the TreeMap, and it will use that object to compare objects and determine the sort order. You can use Comparators to compare objects that do not implement Comparable, or enforce a different sorting strategy. For example, the String.compareTo method performs case-sensitive comparison, but you could provide the String.CASE_INSENSITIVE_ORDER comparator which would result in case-insensitive sorting.