chiark / gitweb /
~mdw / lisp / commitdiff
? search:
summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (from: 6ee5b4a)
aa-tree: Simple balanced binary tree.
authorMark Wooding <mdw@distorted.org.uk>
Tue, 3 Jul 2007 10:45:24 +0000 (11:45 +0100)
committerMark Wooding <mdw@distorted.org.uk>
Tue, 3 Jul 2007 10:45:24 +0000 (11:45 +0100)
I've implemented Andersson trees, which are a particularly simple kind
of balanced binary tree, with the usual performance guarantees for such
things.


No differences found
A small Lisp utilities library