【Java】为什么HashMap中个数超过8才转为红黑树

首先，为啥在jdk.1.8中，HashMap的存储结构变为数组+链表（红黑树）了呢？

当发生hash冲突时，链表的复杂度是O(n)，而树结构的复杂度是O(logn)，当链表不太长的时候，遍历是可以接受的，但超过一定长度，就要转化为树结构了，那为啥是8？

分析源码，作者在注释中是这么说的

TreeNodes占用空间是普通Nodes的两倍，所以只有当bin（bin就是bucket-桶，即HashMap中hashCode值一样的元素保存的地方）包含足够多的节点时才会转成TreeNodes，而是否足够多就是由TREEIFY_THRESHOLD的值决定的。当bin中节点数变少时，又会转成普通的bin。

    /**
     * The bin count threshold for using a tree rather than list for a
     * bin.  Bins are converted to trees when adding an element to a
     * bin with at least this many nodes. The value must be greater
     * than 2 and should be at least 8 to mesh with assumptions in
     * tree removal about conversion back to plain bins upon
     * shrinkage.
     */
    static final int TREEIFY_THRESHOLD = 8;

当hashCode离散性很好的时候，树型bin用到的概率非常小，因为数据均匀分布在每个bin中，几乎不会有bin中链表长度会达到阈值。但是在随机hashCode下，离散性可能会变差，然而JDK又不能阻止用户实现这种不好的hash算法，因此就可能导致不均匀的数据分布。不过理想情况下随机hashCode算法下所有bin中节点的分布频率会遵循泊松分布，作者还给出了泊松分布的公式

这里取

                                                                              

可以看到，链表长度达到8个元素的概率为0.00000006，几乎是不可能事件

     * Because TreeNodes are about twice the size of regular nodes, we
     * use them only when bins contain enough nodes to warrant use
     * (see TREEIFY_THRESHOLD). And when they become too small (due to
     * removal or resizing) they are converted back to plain bins.  In
     * usages with well-distributed user hashCodes, tree bins are
     * rarely used.  Ideally, under random hashCodes, the frequency of
     * nodes in bins follows a Poisson distribution
     * (http://en.wikipedia.org/wiki/Poisson_distribution) with a
     * parameter of about 0.5 on average for the default resizing
     * threshold of 0.75, although with a large variance because of
     * resizing granularity. Ignoring variance, the expected
     * occurrences of list size k are (exp(-0.5) * pow(0.5, k) /
     * factorial(k)). The first values are:
     *
     * 0:    0.60653066
     * 1:    0.30326533
     * 2:    0.07581633
     * 3:    0.01263606
     * 4:    0.00157952
     * 5:    0.00015795
     * 6:    0.00001316
     * 7:    0.00000094
     * 8:    0.00000006
     * more: less than 1 in ten million

因此，源码定义了在binCount>=7（从0开始，0-7一共8个数），即该槽插入第9个节点时(超过8个时)，转为红黑树