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.