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.
- [btreedb] - VC++ Inside of the tree structure, can b
- [TrieTree] - What is the Trie tree? Trie tree of the
- [trie] - Dictionary tree realization, the realiza
- [Trie] - Trie tree can be used for general dictio
- [huffman] - Based on a binary tree of knowledge of u
- [BinaryTree] - err
File list (Check if you may need any files):
TireTree.cpp
Download