/*
* BST Class
*/
public class BST<E extends Comparable<E>> implements BinaryTree<E> {

// Root Node
private Node<E> root;

// Insert Method
public void insert(E item) //inserts an E item to the BST
{
   root = insert(root, item, item);
}

// Insert Recursive Method
private Node<E> insert(Node<E> x, E key, E val) {
   if (x == null) {
         return new Node<E>(key, val);
   }
   int c = key.compareTo(x.key);
   if    (c < 0) {
         x.left = insert(x.left, key, val);
   } else if (c > 0) {
         x.right = insert(x.right, key, val);
   } else {
         x.val = val;
   }
   return x;
}

// Find Method
public E find(E item) //returns the E item, else return null
{
   return find(root, item);
}

// Find Recursive Method
private E find(Node<E> x, E key) {
   if (x == null) {
         return null;
   }
   int c = key.compareTo(x.key);
   if (c < 0) {
         return find(x.left, key);
   } else if (c > 0) {
         return find(x.right, key);
   } else {
         return x.val;
   }
}

// FindNode Recursive Method
private Node<E> findNode(Node<E> x, E key) {
   if (x == null) {
         return null;
   }
   int c = key.compareTo(x.key);
   if (c < 0) {
         return findNode(x.left, key);
   } else if (c > 0) {
         return findNode(x.right, key);
   } else {
         return x;
   }
}

// Delete Method
public void delete(E item)// deletes the E item
{
   delete(root

Objectives: â€¢ To practice writing and testing programmer-defined...