Simple Binary Tree Data Structure Implementation
Project description
pytreelib: Simple Binary Search Tree implementation
Description
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).
Examples
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
Installation
Currently it runs only with python3. Install this package via pip3.
$ pip3 install pytreelib
UPDATES
- Version 0.1.1 [2018-12-12]
Initial Release
Project details
Release history Release notifications | RSS feed
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)
Built Distribution
Close
Hashes for pytreelib-0.1.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 7dba8459d70e7b7391986fb034c8a957df8dce19961d8c2c7281db6fc2f544fc |
|
MD5 | 056782a7616d0a881285111f6b9ace51 |
|
BLAKE2b-256 | cc8e77f7b583490c6d4b569d68e6ccb918db729a5d80a0edf55aeb8303a062c1 |