different types of nodes can be used when the nature of the stored data makes it advantageous to store that data in different formats while in a preferred embodiment leaf search nodes 120 and branch search nodes 130 use linear search to match prefix values against lookup search keys in alternative embodiments leaf search nodes 120 and branch search nodes 130 may use other types of search such as for example a balanced binary tree or a hash table or there may be multiple subtypes of leaf search nodes 120 and branch search nodes 130 each using a distinct type of search adapted to its contents each branch node 110 includes a marker 111 indicating that the node is a branch node 110 and a set of subnode pointers 113 the subnode pointers 113 point to locations for each of the sub tries depending from that branch node 110 that depend from that particular branch node 110 each leaf search node 120 includes a marker 131 similar to a branch node 110 instead indicating that the node is a leaf search node 120 each leaf search node 120 terminates the path down the trie 100 and includes a set of prefix values against which a lookup search key can be matched each leaf search node 120 associates each of its prefix values with a specific data.