Path: utzoo!utgpu!jarvis.csri.toronto.edu!clyde.concordia.ca!mcgill-vision!quiche!calvin!quiche!prodigy
From: prodigy@quiche (Chris ALPAUGH)
Newsgroups: comp.lang.c
Subject: Balanced Binary Search Trees
Message-ID: <2106@calvin.cs.mcgill.ca>
Date: 4 Feb 90 21:24:35 GMT
Sender: prodigy@quiche.cs.mcgill.ca
Reply-To: prodigy@quiche.cs.mcgill.ca (Chris ALPAUGH)
Organization: SOCS, McGill University, Montreal, Canada
Lines: 11

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
out there in net-land done this sort of thing before?  Any ideas, algorithms,
or references to books that deal with Red/Black trees would be *greatly*
appreciated.

Thanks in advance,

Chris Alpaugh

reply to: prodigy@quiche.cs.mcgill.ca