1. Repeat the previous project, but maintain the search keys in sorted order. Use a binary search instead of a sequential search when searching the dictionary for a key. 2. Implement an unsorted...

1. Repeat the previous project, but maintain the search keys in sorted order. Use a binary search instead of a sequential search when searching the dictionary for a key.

2. Implement an unsorted dictionary by using a chain of linked nodes.

3. Implement a sorted dictionary by using a chain of linked nodes.

4. In this chapter, the ADT dictionary has distinct search keys. Implement a dictionary that removes this restriction. Choose one of the possibilities given in Exercise 13 of the previous chapter.