MUD-Dev
mailing list archive
[ Other Periods
| Other mailing lists
| Search
]
Date:
[ Previous
| Next
]
Thread:
[ Previous
| Next
]
Index:
[ Author
| Date
| Thread
]
[MUD-Dev] Re: Red Black Tree ?
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
- Thread context:
- [MUD-Dev] Re: Laws of Online World Design, (continued)
- [MUD-Dev] Re: Red Black Tree ?,
Valerio Santinelli tanis#mediacom,it, Fri 09 Oct 1998, 15:29 GMT
- [MUD-Dev] Re: Marion's Tailor Problem,
Koster, Raph rkoster#origin,ea.com, Fri 09 Oct 1998, 14:59 GMT
[ Other Periods
| Other mailing lists
| Search
]