chiark / gitweb /
~mdw / lisp / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 67b41ed) | 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 10:45:24 +0000 (11:45 +0100)
commit6ee5b4aa8e217890da149dcff3519ca039616041
treeadc1afe076cd1e831aa938609ba50e6755a4cf91tree | snapshot
parent67b41ed338b6050f40bf9de24804502e96f84104commit | 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
A small Lisp utilities library