. A major consideration in designing a symbol table is that insertion and retrieval should be as fast as possible

. One dimensional table: search is very slow

. Balanced binary tree: quick insertion, searching and retrieval; extra work required to keep the tree balanced

. Hash tables: quick insertion, searching and retrieval; extra work to compute hash keys

. Hashing with a chain of entries is generally a good approach

A major consideration in designing a symbol table is that insertion and retrieval should be as fast as possible. We talked about the one dimensional and hash tables a few slides back. Apart from these balanced binary trees can be used too. Hashing is the most common approach.