trie
ordered tree data structure that organizes nodes by common key prefixes
Patricia tree
data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent
C-trie
Type of a data structure
Y-fast trie
data structure for storing integers from a bounded domain
concurrent hash-trie
concurrent thread-safe lock-free implementation of a hash array mapped trie
X-fast trie
data structure for storing integers from a bounded domain