Re: Red Black Trees

2006-05-02 Thread Henning Brauer
* Brian <[EMAIL PROTECTED]> [2006-05-02 07:06]: > I am reading through the tree(3), and I need some clarification. If I want to > correctly remove an element from a red black tree that I have found and free > it's memory allocation, this code should work, right? > > find.i = 400; > n = RB_FIND(

Re: Red Black Trees

2006-05-01 Thread Damien Miller
On Mon, 1 May 2006, Brian wrote: > I am reading through the tree(3), and I need some clarification. If I > want to correctly remove an element from a red black tree that I have > found and free it's memory allocation, this code should work, right? > > find.i = 400; > n = RB_FIND(inttree, &head, &f