Search Tries (from reTRIEval)
M-ary tree, where each node is an M-place vector with components corresponding to characters or digits
Each node on level l represents all valid keys beginning with a certain sequence of l characters
Each node specifies an M-way branch, depending on the (M+1)st character/digit