Description: The principle is the use of a string trie collection of string prefix to reduce the time overhead of public view to increasing efficiency. It has the following properties: 1, root node does not contain any character information 2, if the number of kinds of characters n, then each node of the out-degree of n (this will inevitably lead to waste a lot of space, this is also the shortcomings of trie , I have not thought a good way to avoid points) 3, find, insert the complexity is O (n), n for the length of the string.
File list (Check if you may need any files):
src\log4j.properties
...\org\struct\trietree\TrieTree.java
...\...\......\........\TrieTreeNode.java
...\...\......\trietree
...\...\struct
...\org
src
Download