[Python-Dev] collections.sortedtree

[Antoine Pitrou]

On Wed, 26 Mar 2014 22:31:56 +0200
Marko Rauhamaa <marko at pacujo.net> wrote:
> 
> The primary objective of having a balanced tree in the standard library
> is to support ordered access in an efficient manner. The typical
> applications would include timers (networking), aging (cache)

Wouldn't a heapq work as well for those two?

Regards

Antoine.