Re: Using Red-Black Trees

[Phil Thornley <phil.jpthornley@gmail.com>]

On Nov 13, 11:20 am, Björn <ssh9...@hotmail.com> wrote:
> I need a self-balancing binary search tree (for a Bentley/Ottmann
> implementation), such as the red-black tree that is now part of
> Ada.Containers. I need basic operations like insert/remove, next/prev
> and find. However, the GNAT implementation of this data structure
> seems a bit scary to me and I'm not really sure how to instantiate the
> generics and what operations to use. Would someone be able to provide
> some example of usage? And yes, I'am aware of that a lot of the other
> container implementations uses this structure. I was hoping for
> something a bit more boiled down.
>
> Regards,
> Björn

Have a look at the stuff under Data Structures on
http://www.eternallyconfuzzled.com/jsw_home.aspx

There's a lot of good stuff in there (all in C) including iterative
algorithms for red-black trees that was used for a SPARK project.

Cheers,

Phil