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倍。
2
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
Dynamic look-up table, binary tree using dynamic lookup table, is very useful for beginners, a program that can help him learn good dynamic look-up table data structure!