Write a method of the BinarySearchTree class

Comparable smallest()

that returns the smallest element of a tree.

Also add a recursive helper method to the Node class.

Draft: Return the smallest element from a binary search tree which has just a root and two child nodes.