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倍。
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倍。
应用推荐