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倍。
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.
和其它的提供了最坏情况O（log n） 查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
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!
动态查找表，二叉树的应用动态查找表，对初学者是非常有用的一个程序，可以帮助他学习好数据结构的动态查找表！
应用推荐