A non-recursive algorithm of constructing strict balance two binary search tree

In view of the balance two binary search tree constructed with the traditional algorithm is not a really bal- ance binary search tree,this paper idesigns a non- recursive algorithm of constructing a strict balance two binary search tree. The improved algorithm has the advantages of faster calculation speed,small memory space,being easy to be realized by computers. The core of the improved algorithmto is to generate the first order sequence of the strict two binary search tree. It is proposed to find the optimal solution of routing problem. It presents a method to gain the the first order sequence of the strict two binary search tree by dividing the ascending sequence into half,discusses and gives a s fast algorithm to construct the strict binary search tree. The algorithm makes full use of the information divided by two to gain the first order sequence of the strict two binary search tree. The algorithm has higher efficien- cy compared with the traditional algorithm to construct a strict two binary search tree.