Balanced trees

[Marko Rauhamaa]

Dan Stromberg <drsalists at gmail.com>:

> The results are at
> http://stromberg.dnsalias.org/~strombrg/python-tree-and-heap-comparison/2014-03/

Unfortunately I'm having a hard time understanding the results.

The 50/50 get/set ratio is most interesting to me.

I'm seeing (under cpython-3.3):


    Size: 1048576, duration:  75.3, dictionary type: dict
    [...]
    Size:  262144, duration:  66.1, dictionary type: AVL_tree
    [...]
    Size:   65536, duration:  77.3, dictionary type: blist.sorteddict 


What does it mean?


Marko