Built-in binary search tree in Python? [closed]
There’s no special reason, to my knowledge – I’d guess that the reason is that for so many applications the highly-tuned dict and set implementations (which are hash tables) work well. They’re good enough in most cases. There are definitely situations where you need the performance characteristics of balanced binary search trees (like ordered traversal … Read more