Write a method of the BinarySearchTree class

Comparable smallest()

that returns the smallest element of a tree. You will also need to add a method to the Node class.

Complete the following file:

BinarySearchTree.java

Use the following file:

SmallestTester.java

/**
   A test program for the smallest method of the BinarySearchTree class.
*/
public class SmallestTester
{  
   public static void main(String[] args)
   {  
      BinarySearchTree names = new BinarySearchTree();
      names.add("Romeo");
      names.add("Juliet");
      names.add("Tom");
      names.add("Dick");
      names.add("Harry");

      System.out.println(names.smallest());
      System.out.println("Expected: Dick");
   }
}