Balanced trees

Steven D'Aprano steve+comp.lang.python at
Wed Mar 19 02:15:53 CET 2014

On Tue, 18 Mar 2014 15:21:28 -0700, Dan Stromberg wrote:

> On Tue, Mar 18, 2014 at 3:03 PM, Marko Rauhamaa <marko at>
> wrote:
>> Dan Stromberg <drsalists at>:
>> For a proper comparison, I'd like a fixed, identical dataset and set of
>> operations run against each data structure.
>> How about this test program:
> I used to do essentially this, but it was time-prohibitive and produced
> harder-to-read graphs - harder to read because the enormous values of
> the bad trees were dwarfing the values of the good trees.

A log graph may be the solution to that: graph the log of the time rather 
than time itself.


More information about the Python-list mailing list