A function for generating nearly balanced binary search trees from sets of non-random keys

A function for generating nearly balanced binary search trees from sets of non-random keys is described. This function can be used in hashing organization where collisions are resolved by construction of binary trees. In particular it can be used as the secondary function in the relatively new technique of dynamic hashing.