Some implementations:
Lisp: http://cliki.net/bk-tree
Python: http://hupp.org/adam/weblog/?p=103
Ruby: https://github.com/threedaymonk/bktree
Haskell: http://www.robdickerson.net/?p=346
Lisp: http://cliki.net/bk-tree
Python: http://hupp.org/adam/weblog/?p=103
Ruby: https://github.com/threedaymonk/bktree
Haskell: http://www.robdickerson.net/?p=346
Edit: The lisp page does have a nice picture of a tree. Did you mean that looking at that picture you could figure out both the algorithm for building the tree and for querying it and the proof that these are correct faster than by reading Nick's blog post?