| 摘要: |
| 本文描述了一种Ｔｒｉｅ结构，给出了这种Ｔｒｉｅ结构的插入，查找算法，查找算法的时间复杂度为O(lognK），与以前的工作相比，这是一个改进。本文也给出了将Ｔｒｉｅ结构存放在一维数组后的查找算法。 |
| 关键词: Trie结构，查找，压缩 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学资金 |
|
| A KIND OF TRIE STRUCTURE |
|
Huang Jingwei,Dai Dawei
|
| Abstract: |
| n this paper, a kind of Trie structure is described. The insertion and search algorithms on this kind of Trie structure are presented. The time complexity the search algorithm is O(lognK). Comparing to prior work, it is a improvement. This paper also presents the search algorithm on this kind of Trie structure stored into an one dimension array. |
| Key words: Trie structure searching compression. |
