From: Scott L. Burson
Subject: Functional B-tree implementation?
Date: Sat, 31 May 1997 00:00:00 +0000
Message-ID: <3390BD8A.41C67EA6@zeta-soft.com>

Hi all,

Does anyone here have, or know of, a "functional" B-tree implementation
in Lisp or any other language?  By "functional" I mean that nodes are
never modified once built; when a key -> value pair is added to or
removed from the tree, new nodes are consed as necessary up to and
including the root.  Thus the old root still holds the previous tree.

-- Scott

From: Scott L. Burson
Subject: Re: Functional B-tree implementation?
Date: Sun, 01 Jun 1997 00:00:00 +0000
Message-ID: <3391C88C.167EB0E7@zeta-soft.com>

Scott L. Burson wrote:
> 
> Does anyone here have, or know of, a "functional" B-tree implementation
> in Lisp or any other language?

Never mind, I found something (a functional variant of skip lists).

-- Scott