Newsgroups: comp.archives
Path: utzoo!utgpu!news-server.csri.toronto.edu!ox.com!msen.com!emv
From: markf@zurich.ai.mit.edu (Mark Friedman)
Subject: [scheme] Re: looking for balancing (binary/avl) tree programs
Message-ID: <1991May21.052618.2691@ox.com>
Followup-To: comp.lang.scheme
Sender: emv@msen.com (Edward Vielmetti, MSEN)
Reply-To: markf@zurich.ai.mit.edu
Organization: M.I.T. Artificial Intelligence Lab.
References: <1991May20.150025.16099@uicbert.eecs.uic.edu> 
Date: Tue, 21 May 1991 05:26:18 GMT
Approved: emv@msen.com (Edward Vielmetti, MSEN)
X-Original-Newsgroups: comp.lang.scheme

Archive-name: languages/algorithms/scheme-btree/1991-05-20
Archive: altdorf.ai.mit.edu:/pub/btree.scm [18.43.0.246]
Original-posting-by: markf@zurich.ai.mit.edu (Mark Friedman)
Original-subject: Re: looking for balancing (binary/avl) tree programs
Reposted-by: emv@msen.com (Edward Vielmetti, MSEN)


In article <1991May20.150025.16099@uicbert.eecs.uic.edu> lam@uicbert.eecs.uic.edu (Michael Lam) writes:

   I am looking for scheme programs written for balancing 
   binary/avl tree for database applications.  Any related
   things (like B-trees) are also of interest.  Thanks in
   advance.

I have placed pub/btree.scm on altdorf.ai.mit.edu available for
anonymous FTP. Chris Hanson wrote it (based on Knuth). I believe that
it is vanilla Scheme, except for some DEFINE-INTEGRABLE's that you may
feel free to change to DEFINE's.

-Mark
--

Mark Friedman
MIT Artificial Intelligence Lab
545 Technology Sq.
Cambridge, Ma. 02139

markf@zurich.ai.mit.edu

-- comp.archives file verification
altdorf.ai.mit.edu
-rw-rw-r--   1 5285     users       8429 May 20 13:50 /pub/btree.scm
found scheme-btree ok
altdorf.ai.mit.edu:/pub/btree.scm