Re: Red Black Trees
- From: "Julienne Walker" <happyfrosty@xxxxxxxxxxx>
- Date: 30 Oct 2005 15:45:49 -0800
R. Vowels wrote:
> Julienne Walker wrote in message <1130519250.111927.290450@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>...
> |http://www.eternallyconfuzzled.com/tuts/redblack.html
> |
> |There are a bunch of ways that you can implement a red black tree.
> |Personally I think that the CLR method is overly complicated.
>
> Any particular procedure, or all of them?
Well, I had deletion in mind, but CLR presents all of them in a
complicated way. In particular, I feel that any bottom-up red black
algorithm is more complicated than it should be because it has to do
something awkward to move up instead of down (such as parent pointers,
threads, or recursion).
.
- References:
- Re: Red Black Trees
- From: Julienne Walker
- Re: Red Black Trees
- From: R. Vowels
- Re: Red Black Trees
- Prev by Date: What is a "null loop"?
- Next by Date: Re: Synchronization routine
- Previous by thread: Re: Red Black Trees
- Next by thread: Re: Red Black Trees
- Index(es):