# 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

![](https://2548495579-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2FTsnKOX7xLvOtvOXY9MlI%2Fuploads%2F1lhO0CMbQS3WZavskGeS%2Fimage.png?alt=media\&token=458501c2-c4a7-4aed-96a0-b12b24fde85e)