1. A method of organizing a non-redundant binary tree look-up table to store electric signals representing groups of one or more entry symbols, and electric signals representing translation symbols corresponding to the groups of entry symbols, the steps comprising: providing a main level of memory locations; storing particular sublevel pointer addresses in selected ones of said main level memory locations; providing a plurality of sublevels of memory locations; associating selected sublevels with selected ones of said sublevel pointer addresses located in said main level; storing particular pointer addresses in selected memory locations in said plurality of sublevels; associating selected ones of said plurality of sublevels with selected ones of said sublevel pointer addresses located in said sublevel memory locations such that selected sublevels are associated with selected other sublevels thereby forming a binary tree; and allocating no more than one of the entry symbols from the groups of entry symbols to said main level and sublevel memory locations containing pointer addresses.
3. The method defined in claim 1 further comprising the steps of: storing particular translation pointer addresses in selected rows of said main level and selected rows of said plurality of sublevels; said particular translation pointer addresses corresponding to translation memory locations containing at least one group of translation symbols.