Abstract: Address lookup techniques are presented that process input data and that utilize a number of node information structures. One or more of the node information structures is part of a radix tree. A bit or bits of the input data are selected by using a next node selector from a first node information structure. The first node information structure also comprises a pointer. One or more memory accesses are performed by using at least one memory address defined at least in part by the selected one or more bits and the pointer from the first node information structure. The one or more memory accesses access another node information structure comprising another pointer. In an illustrative embodiment, this process is repeated until a resultant address is determined. Node information structures may comprise leaf/branch indicators, which indicate whether a node is a leaf or a branch. When a leaf branch indicator indicates a leaf, the resultant address is found.