No project description provided
Project description
Binary Tree
A binary tree implementation is available:
from datastructures import Tree, Node
tree = Tree()
tree.size() // 0
tree.max_depth() // 0
tree.root // None
root = tree.add() // Node
root.left = Node()
tree.size() // 2
tree.max_depth() // 2
To check if the tree is a binary search tree:
tree.is_bst()
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
datastructures-0.1.0.tar.gz
(88.0 kB
view hashes)
Built Distribution
Close
Hashes for datastructures-0.1.0-cp35-cp35m-macosx_10_11_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | fa7bf08a8a9f5f87071e852cc60936737e92516356517bda023537e34616df9d |
|
MD5 | d995e8122e02875842f2c41fdbd82948 |
|
BLAKE2b-256 | 452a6730b67bc456ed56860436de26a4594029ecd73899f6a0b7c10df41f232b |