Patricia tree
Sign in to saveAlso known as compact prefix tree, radix trie
data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent
Also known as compact prefix tree, radix trie
data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent