mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 12:16:29 +08:00
951599e192
* 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>
|
||
|---|---|---|
| .. | ||
| assets/images | ||
| chapter_appendix | ||
| chapter_array_and_linkedlist | ||
| chapter_backtracking | ||
| chapter_binary_search | ||
| chapter_computational_complexity | ||
| chapter_data_structure | ||
| chapter_graph | ||
| chapter_hashing | ||
| chapter_heap | ||
| chapter_introduction | ||
| chapter_preface | ||
| chapter_reference | ||
| chapter_searching | ||
| chapter_sorting | ||
| chapter_stack_and_queue | ||
| chapter_tree | ||
| index.assets | ||
| stylesheets | ||
| index.md | ||