Answers

7. public class BinarySearchTree<E extends Comparable>

8. public static <E extends Measurable> E min(E[] a)
   {
      E smallest = a[0];
      for (int i = 1; i < a.length; i++)
         if (a[i].getMeasure() < smallest.getMeasure()) < 0)
            smallest = a[i];
      return smallest;
   }