* Revised the figures thoughout the book.
* Utilize roboto and roboto mono as the font faimly of the English edition
* Fix the naming style
* Update two figures.
* Fix margin of the hero image
* Fix margin of the hero image
* Sync recent changes to the revised Word.
* Revised the preface chapter
* Revised the introduction chapter
* Revised the computation complexity chapter
* Revised the chapter data structure
* Revised the chapter array and linked list
* Revised the chapter stack and queue
* Revised the chapter hashing
* Revised the chapter tree
* Revised the chapter heap
* Revised the chapter graph
* Revised the chapter searching
* Reivised the sorting chapter
* Revised the divide and conquer chapter
* Revised the chapter backtacking
* Revised the DP chapter
* Revised the greedy chapter
* Revised the appendix chapter
* Revised the preface chapter doubly
* Revised the figures
* 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>
