A generic tree implementation in Java aimed to provide as many different tree implementations as possible.
Create a class that implements the INodeValue interface. Implement the compareTo method to compare values the desired way.
See the benchmark folder for a working example.
###Binary Tree The tree will insert values with a maximum children count of two. The value inserted first act as pivot point for the rest of the values. Lesser values are placed in the left branch, greater values in the right branch.