Repeat Project 9 in Chapter 18, but study a binary search tree instead of a sorted list. Consider the binary search tree methods add, remove, get Entry, and contains. Compare the performance of the...

Repeat Project 9 in Chapter 18, but study a binary search tree instead of a sorted list. Consider the binary search tree methods add, remove, get Entry, and contains. Compare the performance of the class BinarySearchTree with that of the two versions of LinkedSortedList that you studied in Chapter 18.