Trie key span

The span of a trie level is the number of bits that each partial key/digit represents.

• If the digit exists in the corpus, then store a pointer to the next level in the trie branch. Otherwise, store null.

This determines the fan-out of each node and the physical height of the tree.

• n-way Trie = Fan-Out of n