Skip to main content

Simple Binary Search Tree is a simple implementation of a binary search tree

Project description

Simple Binary Search Tree is a simple implementation of a binary search tree


To use Simple Binary Search Tree in a project:

# At minimal, you'll need to import simplebst.Node
from simplebst import Node

# Create a single element tree with value of 23
# Its left and right sub-trees are set to None
tree = Node(23)

Get the value of a Node:


Get the left/right child Node of a Node:


Insert a new node into the tree:

# Import simplebst.utils.insert_node
from simplebst.utils import insert_node

# Insert a node will modify the tree you specify
# So, we'll use our previous example of "tree"
insert_node(tree, 17)

# If you were curious you should see the correct
# value if you do the following

# Let's fill the tree with values
for value in [18, 27, 53, 11]:
    insert_node(tree, value)

For more detailed usage, please see the usage documentation:


0.1.0 (2014-09-11)

  • First release on Github.

0.2.0 (2014-09-19)

  • Code cleanup and updated utils and traversals

0.3.0 (2014-10-08)

  • Added the following traversals:
    • Pre-order

    • Post-order

    • Level-order

0.4.0 (2014-10-16)

  • Added tree_height() util

  • Added insert_node() unit tests that I missed previously (yay for code coverage!)

0.4.1 (2014-10-22)

  • Updated to support nose as its test suite So `python test` can be run successfully.

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

simplebst-0.4.1.tar.gz (14.0 kB view hashes)

Uploaded source

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page