1. A multi-level lookup table comprising: a plurality of memories, a binary tree representation of a routing table mapped into the memories, with each memory associated with one level of the binary tree; and logic which allows storage of a subtree associated with a densely populated level of the binary tree in a memory associated with a level lower than the densely populated level of the binary tree to increase the number of locations for storing routes for the densely populated level.