Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!think.com!mintaka!ai-lab!zurich.ai.mit.edu!markf From: markf@zurich.ai.mit.edu (Mark Friedman) Newsgroups: comp.lang.scheme Subject: Re: looking for balancing (binary/avl) tree programs Message-ID: Date: 20 May 91 17:55:51 GMT References: <1991May20.150025.16099@uicbert.eecs.uic.edu> Sender: news@ai.mit.edu Reply-To: markf@zurich.ai.mit.edu Distribution: comp Organization: M.I.T. Artificial Intelligence Lab. Lines: 21 In-reply-to: lam@uicbert.eecs.uic.edu's message of 20 May 91 15:00:25 GMT 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