Is there a module for balanced binary tree in Python's standard library?

Is there a module for an AVL tree or a red–black tree or some other type of a balanced binary tree in the standard library of Python?

Solution 1:

No, there is not a balanced binary tree in the stdlib. However, from your comments, it sounds like you may have some other options:

• You say that you want a BST instead of a list for O(log n) searches. If searching is all you need and your data are already sorted, the bisect module provides a binary search algorithm for lists.
• Mike DeSimone recommended sets and dicts and you explained why lists are too algorithmically slow. Sets and dicts are implemented as hash tables, which have O(1) lookup. The solution to most problems in Python really is "use a dict".

If neither solution works well for you, you'll have to go to a third party module or implement your own.

Solution 2:

there is nothing of this sort in stdlib, as far as I can see, but quick look at pypi brings up a few alternative:

• rbtree
• pyavl
• blist