A binary search tree implemented for learning purposes.
In school, I struggled with how binary search trees (and related data structures & algorithms) work, but now with a little more programming experience under my belt I decided to work through implementing one. It currently has insert, search, and traversal functionality.
pip install bst
from bst import BST bst = BST() bst.insert(5) node = bst.search(5) # <bst.Node object at 0x1060964e0> node.value # 5
The only dependency is
nose, it's used to automatically run all of the unit tests in
tests/. Install dependencies with
pip install -r requirements.txt, and run the tests with
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size bst-0.5.0-py2.py3-none-any.whl (3.1 kB)||File type Wheel||Python version py2.py3||Upload date||Hashes View hashes|
|Filename, size bst-0.5.0.tar.gz (3.3 kB)||File type Source||Python version None||Upload date||Hashes View hashes|