Repeat Exercise 9, but instead use a binary search tree to organize one of the search keys and a sorted linked chain to organize the second search key.
Exercise 9:
Suppose that you want to support two remove operations for the ADT dictionary-for example, remove By Name and remove By ID.
Describe an efficient implementation for these operations.