Balanced trees

Marko Rauhamaa marko at
Sun Mar 9 10:17:33 CET 2014

Roy Smith <roy at>:

>  Marko Rauhamaa <marko at> wrote:
>> If I had to choose between a hash table and AVL (or RB) tree in the
>> standard library, it would definitely have to be the latter. It is more
>> generally usable, has fewer corner cases and probably has an equal
>> performance even in hash tables' sweet spot.
> The C++ folks made that decision, and people spent the next 10 years
> complaining, "Why is there no hash table in STL?"

Well, luckily, nobody should need to choose. Even STL has an
unordered_map now.


More information about the Python-list mailing list