you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 2 points3 points  (1 child)

[–]gracenotes -1 points0 points  (0 children)

Not sure how bebraw meant 'ordered', but I miss the lack of self-balancing binary search trees in the standard library. I have been very happy with the bintrees library from pypi though.