Path: utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!uunet!samsung!zaphod.mps.ohio-state.edu!rpi!leah!emb978
From: emb978@leah.Albany.Edu (Eric M. Boehm)
Newsgroups: comp.lang.c
Subject: Re: Balanced Binary Search Trees
Summary: C code for red/black trees
Message-ID: <2481@leah.Albany.Edu>
Date: 5 Feb 90 14:49:20 GMT
References: <2106@calvin.cs.mcgill.ca>
Organization: The University at Albany, Computer Services Center
Lines: 26

In article <2106@calvin.cs.mcgill.ca>, prodigy@quiche (Chris ALPAUGH) writes:
> I'm trying to implement several functions in C, to deal with Red/Black
> balanced binary search trees. (ie. insert, delete, member, etc).  Has anybody

I tried responding by mail, but the mail was undeliverable despite two
attempts using different methods.

I wrote a program using red/black trees. I obtained the algorithms and
code from Algorithms by Robert Sedgewick. The code was originally
written in PASCAL but I had no problem converting it to C. If you want,
I could send you a copy of the code.

If you know a way for me to get mail to you, let me know. I am looking
into it at my end.

--
Eric M. Boehm
EMB978@leah.Albany.EDU
EMB978@ALBNYVMS.BITNET



-- 
Eric M. Boehm
EMB978@leah.Albany.EDU
EMB978@ALBNYVMS.BITNET