* Update hash_collision.md
a detailed description of the conditions for converting a linked list into a red-black tree is as follows.
```java
final void treeifyBin(Node<K,V>[] tab, int hash) {
int n, index; Node<K,V> e;
if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
}
```
* Update hash_collision.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* docs(Hashing/Hash_Collision): add go part.
* docs(Hashing/Hash_Collision): add go part.
* docs(Hashing/Hash_Collision): add go part.
* docs(Hashing/Hash_Collision): add go part.
* docs(Hashing/Hash_Collision): add go part.
* Update hash_collision.md
* fix context logic question
* Update Go language hash table collision handling to limit each bucket to 8 entries and compare keys' high 8 bits of hash to reduce access to key-value pairs
* Update hash_collision.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
krahets
Suremotoo
iScream
FanXue