Give a 12-bit address that will end the search at a green node that is not a leaf.

What is the best matching prefix for it?

Address Lookup Using Tries address: 1011 0001 1000 0 A1 0 0/ 1 11 11 11 0/1 0 1 1 1 Prefixes stored in binary trie. Green nodes denote terminal nodes for prefixes. Search for address, by using address bits to traverse path from route. Remember most recent green node visited. If search ends at leaf, then exact match. If search ends because no matching branch, go back to last green node. Number of memory accesses proportional to address length (32 in IPv4, 128 in IPv6). 0 11 0/\1 11 0/1