traversing binary tree algorithm 二叉树遍历算法
traversing of binary tree 二叉树遍历
binary tree traversing 二叉树遍历
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.
通过将二维码表转换成二叉树形式，避免了对整个码表的遍历查找过程，使查找速度提高了2 ~ 3倍。
应用推荐