Efficient binary search tree stored in a flat array?

Douglas Alan darkwater42 at gmail.com
Wed Jul 15 00:54:31 CEST 2009


On Jul 14, 7:38 am, Florian Brucker <t... at torfbold.com> wrote:

> Douglas Alan wrote:

> > Thank you. My question wasn't intended to be Python specific, though.
> > I am just curious for purely academic reasons about whether there is
> > such an algorithm. All the sources I've skimmed only seem to the
> > answer the question via omission. Which is kind of strange, since it
> > seems to me like an obvious question to ask.

> IIRC comp.programming would be the place to ask such questions.

Thanks, yes that does look like a good place to post such questions.
Unfortunately, it also looks to be overrun with stories on "hot girls
top and bottom sexy movie", though I'm sure I can ignore those. I'm
scared to look at the posting on "tricky bit twiddling", though.

|>ouglas




More information about the Python-list mailing list