Implement the symbol table described in Exercise 5 by reusing the class Tree Dictionary , as described in Section 18.2.2 of this chapter.
Exercise 5:
A C++ compiler uses a symbol table to keep track of the identifiers that a program uses. When the compiler encounters an identifier, it searches the symbol table to see whether that identifier has already been encountered. If the identifier is new, it is inserted into the table. Thus, the symbol table needs only insertion and retrieval operations. Which implementation of the ADT dictionary would be most efficient as a symbol table?