Skip to content

3.0.0

Compare
Choose a tag to compare
@joowani joowani released this 19 Dec 14:09
  • Full documentation is now here!

  • Complete overhaul (with non-backward compatible API changes):

    • Many new methods added to binarytree.Node class.
    • Replaced binarytree.convert method with binarytree.build and builtin iter method
    • Renamed binarytree.Node.show to binarytree.Node.pprint
    • Removed functions such as binarytree.subtree, binarytree.prune and binarytree.leafs. Now all introspection & management of trees and nodes are done through methods provided by binarytree.Node.
    • Removed customize method as it was unnecessarily complicating things. If you want to use your own custom node, you can always subclass binarytree.Node.
    • Added binarytree specific exceptions.
    • Some new features include level-order based indexing and traversals (inorder, preorder, postorder). Again, check them out in the new documentation!
    • Add perfect heap and BST generation via new is_perfect boolean parameter.