Posts in topic data-structure
- Hash trie
- Tries are very useful data structures if you need to perform longest subprefix matching. Unfortunately, simple implementations uses a lot of memory, which is often solved by collapsing common prefixes in a single node (like a Radix tree). However, this… Published August, 10, 2012
View list of topics.
Copyright © 2020 Leandro A. F. Pereira