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.

I indent my Python program using two spaces rather than the more common four spaces. The program imports the NumPy library which contains numeric array functionality. The DecisionTree module has the ...