By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.

Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.

By using binary tree instead of2-D table, the new method can avoid of traversing in whole table to find a matched code, and can speedup lookup pro cess2 ~ 3times.