Consider an operation replace(replacementItem, search Key) that locates, if possible, the item in a dictionary with the given search key. If the dictionary contains such an item, the method replaces...

Consider an operation replace(replacementItem, search Key) that locates, if possible, the item in a dictionary with the given search key. If the dictionary contains such an item, the method replaces it with replacement Item .

a. Write implementations of replace for the classes Array Dictionary, Tree Dictionary, and Hashed Dictionary, as described in this chapter.

b. For Tree Dictionary, under what circumstances can replace replace an item without altering the structure of the binary search tree?