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.

src\log4j.properties
...\org\struct\trietree\TrieTree.java
...\...\......\........\TrieTreeNode.java
...\...\......\trietree
...\...\struct
...\org
src

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．