Because establishment of a strict balanced two binary tree needs the help of the stack , this paper presents an algorithm to establish a strict balanced two binary tree without the help of the stack .In order to search for key-words in half , it needs to sort the existing keyword sequence .It statistics the number of comparision in binary search in the ordered keyword sequence .A strict balanced binary tree sequence will be obtained by the sortion of the times of comparison of the keywords after the statistics .Finally, a strict balance two fork tree is obtained after every keyword has been su...