~mdw / lisp / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: f5612ed) | patch
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 12:18:31 +0000 (13:18 +0100)
commit0a198ceab8afb11ff5ce1ee614d22bc80970c187
tree477e7c2be07a9f70fad76c13aacb960e40af78f7tree | snapshot (tar.gz zip)
parentf5612edb087fb1883958d0fbf37331b6d9119042commit | diff
aa-tree: Simple balanced binary tree.

I've implemented Andersson trees, which are a particularly simple kind
of balanced binary tree, with the usual performance guarantees for such
things.
aa-tree.lisp [new file with mode: 0644] blob
mdw.asd diff | blob | blame | history
A small Lisp utilities library