Balanced Binary Search Trees

[Eric M. Boehm]

In article <2106 at calvin.cs.mcgill.ca>, prodigy at 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 at leah.Albany.EDU
EMB978 at ALBNYVMS.BITNET



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