Answer the following statements true (T) or false (F)

1. An implementation of the ADT dictionary using a binary search tree is a poor choice for retrieval dominate applications.
2. Because linear implementations are easy to understand conceptually they are appropriate for dictionaries that will only contain a small number of entries.
3. According to the text, if the size of a problem is small, the difference in efficiency among possible solutions is likely insignificant.
4. If the size of a dictionary is small, a linear implementation is inadequate and difficult to understand.
5. A perfect hash function maps each search key into a unique location of the hash table.

1. False
2. True
3. True
4. False
5. True