Expand description
§Patricia/Radix Trie
A Patricia trie is a trie in which nodes with only one child are merged with the child, giving huge space savings for sparse tries. A radix tree is more general, working with keys that are arbitrary strings; a Patricia tree uses bitstrings.
Structs§
- Items
- Iterator
- MutItems
- Mutable iterator
- Patricia
Tree - Patricia troo