k-tree 0.0.2

This is a data structure to represent and manage k-trees, primarily created for use in RubyNEAT, but may see other possible applications. The goal here is to be roebust in the creation of your k-tree, to allow you to prune during creation, since, especially for higher-dimensional trees, the number of leaf node can become very large. So a parent will have children nodes created down to the desired resolution, and immediately after the creation of the children, will check to see if there's enough variance among the children to keep them. If not, they are pruned immediately.