Implement CART trees

[mbillingr]

Along with #25 this would allow us to implement original Random Forests.

I guess an efficient implementation would sort the data along the feature, start with all samples on one side of the split, and then move one sample after the other across the split. This implementation will require some changes of to the Split-Criterion interface so that samples can be added to and removed from the accumulator.