Dear gentleman, thank you for time and cooperation. Now, i know there are many ways to implement a tree structure. But, searching google a little bit more, i could see some different ways to implement a red-black tree: top-down,buttom-up, using an explicit stack (on the programmer's own), implementing it recursively, etc.
Which of them happens to be the fatest? Which one did OpenBSD used? Once more, thank you a lot. On 4/6/06, Ray Lai <[EMAIL PROTECTED]> wrote: > On Thu, Apr 06, 2006 at 05:07:14PM -0300, Gustavo Rios wrote: > > Hey folks, > > > > i saw OpenBSD comes with a library that implements a redblack tree > > features. I know there are many ways to implement it. The difference > > is in performance. I don't know the fastest one. > > > > May some of the openbsd friends suggest one? > > > > Thanks a lot for your time and cooperation. > > man tree(3) > > -Ray-
