v0.1.2

Changelog

• Added support for tree and node hashing.
• Added ability to traverse the tree.
• Added support for tree naming for quick distinction when working with multiple trees. The name is optional and is provided when creating the tree. Tree::new(Some("TreeName")).
• Multiple nodes are now represented by a Nodes type.

v0.1.1

Changelog

• Improved serialization of the tree.
• Added more unit and regression tests.
• Getting the children of a node returns a Vec<Q> which is basically a list of node ids rather than actual node elements.
• Changed some of the functions in the API to take references instead of actual values. Including
  • Tree<Q, T>::get_node(&self, node_id: &Q)
  • Tree<Q, T>::remove_node(&self, node_id: &Q, strategy: NodeRemovalStrategy)
  • Tree<Q, T>::get_subtree(&self, node_id: &Q, generations: Option<i32>)
  • Tree<Q, T>::add_subtree(&self, node_id: &Q, subtree: SubTree<Q, T>)

v0.1.0

The Initial Release

Provides a Tree<Q, T> Data structure to hold heirachial data