http://github.com/willemt/YABTorrent/blob/master/src/bt_blacklist.c
In comparison to red-black trees, AVL trees have slower insertion and removal but faster retrieval.
forked from willemt/array-avl-tree
-
Notifications
You must be signed in to change notification settings - Fork 0
weskerhluffy/array-avl-tree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An AVL tree implemented with an array, because cache misses keep you awake at night. Using a BSD license
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- C 95.3%
- Shell 3.0%
- Makefile 1.7%