Searching a table in memory

A method of efficiently searching a table 11 stored in a memory for a record identifying a stored data word corresponding to a binary data word input at 13, wherein the table is comprised of records each containing a select value field, a left search table address field, a right search table address field, and left and right search table address leaf fields, comprises (a) indicating at 15 a particular single bit of the binary input data word based on a value stored in a select value field, (b) reading at 17 either the left or right search table address fields of the record containing the value stored in the first select value field, depending on the binary value of the particular single bit of the input data word indicated, (c) in the event a leaf field corresponding to the read left or right search table address stores a first binary value, repeating steps (a) and (b) using a record identified by the read left or right search table address, (d) in the event a leaf field corresponding to the read left or right search table address stores a second binary value, terminating the search and using the left or right search table address as an address for the data word stored in a second table. The data word may be a virtual path identifier/virtual circuit identifier word in the header of an asynchronous transfer mode data cell.