I just finished implementing a Trie structure used by a string auto-comleter! Unbelievable! I feel so GREAT! This is another major step towards mastery.
Trie is a very useful data structure and is usually used by search engine and data mining application. Trie is suitable for information retrieval, especially for string matching. Radix tree is a more compact and efficient variation of Trie.
No comments:
Post a Comment