Skip to main content

Simple Binary Tree Data Structure Implementation

Project description

pytreelib: Simple Binary Search Tree implementation


This package provides classes that implements Tree data structure and it’s variants.

BinaryTreeNode contains a data element value and references for parent, right and left child.

BinarySearchTree implements a Binary Search Tree data structure. Offers basic functions (insert, delete, search, status, display).


To create a node:

>>> from pytreelib import BinaryTreeNode
>>> node = BinaryTreeNode(10)
>>> print(node.value)  # 10

We can create BST in following ways:

an empty tree:

>>> from pytreelib import BinarySearchTree
>>> tree = BinarySearchTree()

with only root defined:

>>> from pytreelib import BinaryTreeNode, BinarySearchTree
>>> tree = BinarySearchTree(10)
>>> tree = BinarySearchTree(BinaryTreeNode(10))

with list of ints

>>> from pytreelib import BinarySearchTree
>>> tree = BinarySearchTree([10, 9, 8])
>>> print(tree.root)  # BinaryTreeNode:10
>>> print(tree.root.left)  # BinaryTreeNode:8
>>> print(tree.root.right)  # BinaryTreeNode:9


Currently it runs only with python3. Install this package via pip3.

$ pip3 install pytreelib


Version 0.1.1 [2018-12-12]
  • Initial Release

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

pytreelib-0.1.1.tar.gz (3.0 kB view hashes)

Uploaded Source

Built Distribution

pytreelib-0.1.1-py3-none-any.whl (4.6 kB view hashes)

Uploaded Python 3

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