简单二叉搜索树是二叉搜索树的简单实现
simplebst的Python项目详细描述
简单二进制搜索树是二进制搜索树的简单实现
- 自由软件:麻省理工学院许可证
- 文档:https://simplebst.readthedocs.org。
功能
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:
tree.get_value()Get the left/right child Node of a Node:
tree.get_left() tree.get_right()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 tree.get_left().get_value() # 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: https://simplebst.readthedocs.org/en/latest/usage.html
历史记录
0.1.0(2014-09-11)
- github上的第一个版本。
0.2.0(2014-09-19)
- 代码清理和更新的实用程序和遍历
0.3.0(2014-10-08)
- 添加了以下遍历:
- 预订
- 下单后
- 水平顺序
0.4.0(2014-10-16)
- 添加了tree_height()util
- 添加了我之前错过的insert_node()单元测试(是的,代码覆盖率!)
0.4.1(2014-10-22)
- 更新setup.py以支持nose作为其测试套件,以便`python setup.py test`可以成功运行。