Balanced trees

Roy Smith roy at
Sat Mar 8 23:22:49 CET 2014

In article <87eh2ctmht.fsf 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?"

More information about the Python-list mailing list