1. Changed main interfaces to classes
2. Added LinkedMultiTreeNode - MultiTreeNode implementation based on the leftmost-child-right-sibling representation
3. Added subtrees clearing logic and tests
4. New find and findAll methods - allows to find nodes within the tree with the specified data

0.1.1

1. Changed java major version to 51 (Java 1.7)
2. Removed unnecessary util package

1. Initial release. There is only one implementation of the K-ary (multi node) tree data structure,
   based on the resizable array