Description: Trie tree, also known as a dictionary tree, word search tree is a tree structure used to save a lot of strings. Its advantages are: the use of a string of public prefix to save storage space, is a relatively simple data structures. Is relatively simple to understand them, but the Trie tree also has its shortcomings, Trie tree is very big memory consumption.
File list (Check if you may need any files):
TireTree\TireTree.dsw
........\TRIETREE报告.doc
TireTree