At 7:45 PM -0400 on 7/24/99, [EMAIL PROTECTED] wrote: >In a message dated 7/24/99 4:01:10 AM, you wrote: > ><<Ah, I see that now. I can supply some source. I'll cook something up >tomorrow >which finds the "closest" match in a red/black tree. >>> > >what the heck is a red/black tree? A special type of binary search tree which keeps itself balanced. There may be some URLs on it in the message archive <http://www.mail-archive.com/[email protected]>
- Re: OODL: Any array classes DeRobertis
- Re: OODL: bison DeRobertis
- Re: OODL: bison spierings
- Re: OODL: bison DeRobertis
- Re: OODL: bison DeRobertis
- Re: OODL: bison M. Uli Kusterer
- Re: OODL: bison spierings
- Re: OODL: bison DeRobertis
- Re: OODL: Requests for OTVar DeRobertis
- Re: Re: OODL: Any array classes MP0werd
- Re: Re: OODL: Any array classes DeRobertis
- Re: Re: OODL: Any array classes Yennie
- Re: OODL: Any array classes Yennie
- Re: OODL: Any array classes Yennie
