Binary Search Tree Python Packages

aabbtree

Pure Python implementation of d-dimensional AABB tree.

dendroid

Search trees (AVL, red-black, splay, plain binary)

binarytree

Python Library for Studying Binary Trees

extra-collections

extra-collections (or extra for short) is a python3 package that provides a pythonic, intuitive, and easy implementation of the most common data structures used in software projects.

py-fds

Simple implementation of data structures for python

tralda

A Python library for tree data structures and algorithms

pytreemap

Python Implementation of Java TreeMap/TreeSet

priority-search-tree

Priority search tree data structure

bst

A binary search tree implemented for learning purposes.

structpie

A set of python modules for data structures written in C

kdtree-python

Implementation of a multidimensional binary search tree for associative searching

pyredblack

Red/black trees in C++ for Python

pytrees

AVL Tree, Interval Tree, Trie and More. All kinds of Trees implemented in python3.

hbst-python

Python bindings for hbst library for visual place recognition

sbbst

A Python implementation of a self balancing binary search tree (AVL Tree). Useful to practice, study and see how the SBBTs works.

sutree

Tree data structure library

competitivepython

Python Algorithms Package used in competitive programming

treestructure

Tree Structure is a module that implements some common trees in data structure.

self-balancing-binary-search-tree

A Python implementation of a self balancing binary search tree (AVL Tree). Useful to practice, study and see how the SBBTs works.