Newsgroups: comp.lang.c
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!caen!hellgate.utah.edu!peruvian.utah.edu!tmurphy
From: tmurphy%peruvian.utah.edu@cs.utah.edu (Thomas Murphy)
Subject: Re: 2-3-4 and Red-Black trees
Date: 12 Apr 91 19:38:50 MDT
Message-ID: <1991Apr12.193851.17757@hellgate.utah.edu>
Organization: University of Utah CS Dept., Salt Lake City
References: <1991Apr12.213711.4099@cunixf.cc.columbia.edu>

In article <1991Apr12.213711.4099@cunixf.cc.columbia.edu> ta-dw30@cunixa.cc.columbia.edu writes:
>Does anyone have C code to initialize, insert into, and pring 2-3-4 trees
>and/or red-black trees?

I suggest you turn to chap 15 of Sedgewick's Algorithims in C
book....I could mail you the code but without the text it wouldn't be
of much use.

murph