Introduction - If you have any usage issues, please Google them yourself
Trie tree can be used for general dictionary english, can also be used to search the index. For a given a string a1, a2, a3 ,..., an. Is used TRIE tree english english after n times to complete a search. But they did not like B-tree search efficiency, B tree search algorithm complexity is logt (n+ 1/2). When t trend, and search efficiency becomes efficient. No wonder the DB2 access memory settings for the virtual memory size of a PAGE, and the frame switching frequency to reduce the need for frequent switching PAGE.
Packet : 85375521trie.rar filelist
Trie.c