4 ms·
I have not implemented a trie myself, but apparently the problem is they take up a lot of space: http://www.drdobbs.com/database/ternary-search-trees/184410528
by yeswecatan 9y ago
I have not implemented a trie myself, but apparently the problem is they take up a lot of space: http://www.drdobbs.com/database/ternary-search-trees/184410528 http://www.drdobbs.com/database/ternary-search-trees/1844105...
- dvirsky 9y agoA trie and a ternary search tree are two very different beasts. Tries can are very memory efficient, as common prefixes in terms are bunched together, and nodes are not split on every letter.