默默的一块石头
发布时间：2019-09-03 16:56:07
In this section we give a brief overview of binary tries and compression techniques. We startwith the de nition of a binary trie. We say that a string w is the i-suffix of the string u, if there isa string v of length i such that u = vw.De nition 2.1. A binary trie containing n elements is a tree w.........【阅读全文】
