public class Node<T>{
   T data;
   Node<T> left, right, parent;

   public Node (T data, Node<T> l, Node<T> r, Node<T> p){
            left = l;
            right = r;
            parent = p;
            this.data = data;
   }
   public Node (T data, Node<T> p){
            this(data, null, null, p);
   }
}

private Node<T> root;
private int size;

public BST() {
   root = null;
   size = 0;
}


public void insert(T data){
   if (root == null) {
         root = new Node<T>(data, null);
   } else{
         insert(root, data);
   }
}

private void insert(Node<T> node, T data){
   int comparison = node.data.compareTo( data ) ;
   if ( comparison > 0 ) {
         if (node.left == null) {
            node.left = new Node<T>(data, node);
            size++;
         } else {
            insert(node.left, data);
         }
   } else if ( comparison < 0 ) {
         if (node.right == null) {
            node.right = new Node<T>(data, node);
            size++;
         } else {
            insert(node.right, data);
         }
   }
}

In this project, you will be assisting your course instructor to co...