MRAB <pyt...@mrabarnett.plus.com>: > Given that Python has dict, there's not much need for a binary search tree.
Dicts don't have the concept of key order. I use my own AVL tree to implement timers. A balanced tree data structure is the only major data structure I've missed in Python. It is there in Java and C++, for example. The Linux kernel makes use of it as well. Marko -- https://mail.python.org/mailman/listinfo/python-list
