Paul Rubin <no.email@nospam.invalid>: > Chris Angelico <ros...@gmail.com> writes: >> First off, what does it actually *mean* to have a tree with numbers >> and keys as strings? Are they ever equal? Are all integers deemed >> lower than all strings? Something else? > > If the AVL tree's purpose is to be an alternative lookup structure to > Python's hash-based dictionaries, then it doesn't really matter what > the ordering between values is, as long as it's deterministic.
I use AVL trees to implement timers. You need to be able to insert elements in a sorted order and remove them quickly. Guido chose a different method to implement timers for asyncio. He decided to never remove canceled timers. Marko -- https://mail.python.org/mailman/listinfo/python-list
