Section 22.8 introduced an algorithm for finding a closest pair of points in O(nlogn) time using a divide-and-conquer approach. The algorithm was implemented using recursion with a lot of overhead. Using an AVL tree, you can solve the same problem in O(nlogn) time. Implement the algorithm using an AVLTree.