Fig. 5

Diagram of trie data structure. The greyed circle is a root of a trie, brown circles are intermediate nodes, and green circles are leaf nodes; numbers in hexadecimal form represent the index and byte associated with a node. A red outline represents the path for finding the partition associated with bytes: k,m,n