Balanced Binary Search Trees

[Chris ALPAUGH]

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 at quiche.cs.mcgill.ca