trie tree, 是一个高效处理字符串的比较常见的算法,能够让我们在复杂度 O(log(n))的情况下插入和查询一个字符串-trie tree, is an efficient treatment of the more common string algorithms, to enable us to the complexity of O (log (n)) the case of insert and query a string