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.

HelloI would like an implementation of tree (not binary), it's declerations, the insert function and if there is the implementation of PorstOrder travel in the tree.thank you very very much,Lena.

The Data Science Lab. Binary Classification Using a scikit Decision Tree. Dr. James McCaffrey of Microsoft Research says decision trees are useful for relatively small datasets and when the trained ...