Balanced trees

Dan Stromberg drsalists at
Sun Mar 9 22:37:39 CET 2014

On Sun, Mar 9, 2014 at 2:32 PM, Marko Rauhamaa <marko at> wrote:
> Dan Stromberg <drsalists at>:
>> This is not just a detail: O(1) tends to be beat O(logn) pretty easily
>> for large n.
> There is no O(1) hash table.

More information about the Python-list mailing list