It's special for word insert/search with fast speed O(k), k is the word length.
Trie Tree Wrapper must implement AddWord and FindWord operations. Its algorithm are almost fixed. Trie Node can be represented as
- Hash
- Array
2015年12月15日星期二
Data Structure -- 4.3 Trie
Trie is a special tree with multiple children and each node saves one char.
It's special for word insert/search with fast speed O(k), k is the word length.
Trie Tree Wrapper must implement AddWord and FindWord operations. Its algorithm are almost fixed. Trie Node can be represented as
It's special for word insert/search with fast speed O(k), k is the word length.
Trie Tree Wrapper must implement AddWord and FindWord operations. Its algorithm are almost fixed. Trie Node can be represented as
订阅：
博文评论 (Atom)
没有评论:
发表评论