A load balancing mechanism maps a binary tree representation of a routing table
into a set of fixed size memories. The mechanism efficiently utilizes the memory
in the routing table without violating the tree precedence constraints and the
memory access requirements of a pipelined system. The mechanism stores a subtree
associated with a densely populated level of the binary tree in memory associated
with lower levels.
