A radix tree is a specialized data structure used to store a set of data indexed by strings. These can be strings of characters, bits or any lexicographically ordered objects. Radix tree are useful ...
A radix tree compresses nodes such that common prefixes are shared. This minimizes memory usage for storing large sets of strings/bytes. Additionally, this library optimizes memory layout/padding to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback