An identification algorithm that recursively builds a binary search tree is presented and an example is thoroughly solved. The algorithm uses concepts from information theory. The theoretical aspects of this algorithm are investigated and the listing of an actual implementation of the algorithm is given in an appendix.
