[Home] [Groups] - Message: [Prev in Group] [Next in Group]

nu.kanga.list.mud-dev

8292: [MUD-Dev] Re: Red Black Tree ?

[Full Header] [Plain Text]
From: "T. Alexander Popiel" <popiel@snugharbor.com>
Newsgroups: nu.kanga.list.mud-dev
Date: Fri, 09 Oct 1998 14:40:16 -0600
References: [1]
Organization: Kanga.Nu
In message:  <199810092109.PAA07254@darklock.com>
             Caliban Tiresias Darklock <caliban@darklock.com> writes:
>
>In a red-black tree, data is stored only in the lowest-level nodes
>(leaves), other nodes in the tree being used only as an index,

*cough*

Where did you get this idea?  I routinely store data in the internal
nodes of a red-black tree, with the leaves being represented by a
single sentinel.  This is the recommended implementation from my
algorithms books, too, so I don't think I've unwittingly mutated
the algorithm...

- Alex