The usual terminology is, * trie is the basic data structure, in which each node is a vector as wide as the alphabet, and the depth is equal to the length of t

The usual terminology is, * trie is the basic data structure, in which each node is a vector as wide as the alphabet, and the depth is equal to the length of the keys * a radix tree is an optimized trie, with path compression and node compression * a patricia tree is a binary radix tree