h3. trie H[N], where H[i] is a trie with height i so when we insert a string with lenght i, we insert it in H[i].

h3. But what happens when we have, say 2 strings, one of length 3, and one with length 10^20? We can't declare H[10^20].

h3. But what happens when we have, say 2 strings, one of length 3, and one with length 10^20^? We can't declare H[10^20^].

h3. Instead we can keep an optimal binary search tree, where the keys are the length of the trie, and the additional information is the