Tree-Based Lookups
Tree search appears useful, but should not be based on direct key compares (we are using bit prefixes, not full keys)
Rather, observe each key (destination address) is composed of a series of bits
Each tree depth will map one or more bits in the search key