[Python-Dev] binary trees.

Vladimir 'Yu' Stepanov vys at renet.ru
Sat May 6 11:31:54 CEST 2006

Martin v. Löwis wrote:
> Vladimir 'Yu' Stepanov wrote:
>> Yes. I understood it when resulted a set example.
>>> However, as I just said, people usually don't remove items from
>>> just-sorted lists, they tend to iterate over them via 'for i in list:' .
>> Such problem arises at creation of the list of timers.
> For a list of timers/timeout events, a priority queue is often the best
> data structure, which is already available through the heapq module.

It is in most cases valid so. heapq very much approaches for these purposes.
The unique problem is connected with removal of an any element from the 

Vladimir Stepanov

More information about the Python-Dev mailing list