GitHub - pem/aatree: C library with a balanced tree implementation based on Arne Andersson's work

pem / aatree Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

C library with a balanced tree implementation based on Arne Andersson's work

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 41 Commits
test		test
.gitignore		.gitignore
LICENSE.txt		LICENSE.txt
Makefile		Makefile
README.txt		README.txt
aabench.c		aabench.c
aatree-test.c		aatree-test.c
aatree.c		aatree.c
aatree.h		aatree.h
aatreem.c		aatreem.c
aatreem.h		aatreem.h

Repository files navigation

A C library with a balanced tree implementation.

This is an implementation of Arne Andersson's algorithm.
It is simpler and balances better than a red-black tree, at the
expense of having an integer (level counter) in each node
instead of just a bit.

See "Balanced Search Trees Made Simple" by Arne Andersson,
http://user.it.uu.se/~arnea/ps/simp.pdf .