A class template for the best binary sort tree

This article makes a detailed analysis about the search time complexity of the strict balanced binary sort tree, and gives a computation formula of the average search length, as well as its error estimate for asymptotic behavior. On the basis of the template of C++ language, this article puts forward a general design of a generic class for the strict balanced binary sort tree and a detailed design of its main member functions. At the end of this article, a guess which is related to estimate about absolute error of approximate calculation of the average search length appeared, what´s more, an idea about the strict balanced binary sort tree in a broad sense also appeared.