Re: Using Red-Black Trees

["robin" <robin51@dodo.com.au>]

[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #1: Type: text/plain, Size: 818 bytes --]

Bj�rn wrote in message <2419e829-6f45-4075-9005-b9876beb8aaa@r6g2000vbf.googlegroups.com>...
>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.


For algorithms for Red-Black trees (inclding insert/delete/etc), see
"Introduction to PL/I, Algorithms, and Structured Programming".