Here is a list of all files with brief descriptions:

[detail level 12]

▼ include
dict.h
hashtable.h	Hash table with separate chaining; each chain is kept sorted by hash value
hashtable2.h	Hash table with open addressing and linear probing
hb_tree.h	Height-balanced (AVL) tree
pr_tree.h	Path-reduction tree [Gonnet 1983]
rb_tree.h	Red-black tree
skiplist.h	Skip list [Pugh 1990]
sp_tree.h	Splay tree
tr_tree.h	Treap: a binary search tree on the keys that is at the same time a max-heap on per-node priorities
wb_tree.h	Weight-balanced tree, BB[alpha] with alpha = 1 - sqrt(2)/2
▼ src
dict.c
dict_private.h
hashtable.c
hashtable2.c
hashtable_common.c
hashtable_common.h
hb_tree.c
pr_tree.c
rb_tree.c
skiplist.c
sp_tree.c
tr_tree.c
tree_common.c
tree_common.h
wb_tree.c