In this article, we saw how a simple binary tree could be implemented with ease using VB.NET. Guys from the C world would notice that malloc, sizeof and free were not used used here.

Both a sorted array and a binary tree can let you look up an element in log(N) time. However I would expect a sorted array to be faster in practice because of the constant factor.

For binary tree classification, the variable to predict should be encoded as 0 or 1. Although it's not technically necessary, I prefer to normalize all predictor values to the same range, typically ...