The underlying hash table is implemented by linked lists and red-black trees. When the internal bucket exceeds a given threshold, it automatically converts from a linked list to a red-black tree. The test code is located in main.c
-
Notifications
You must be signed in to change notification settings - Fork 1
hesphoros/luHashTable
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Packages 0
No packages published