Someone's BST homework

BinarySearchTree.java

import java.util.Scanner;

public class BinarySearchTree extends BinaryTree 
{
  public void insert(Comparable item)
  {
    if (getRoot() == null)
      setRoot(new TreeNode(item));
    else
    {
      TreeNode p, q = null;

      q = getRoot();

      while (q != null)
      {
        p = q;

        if (item.compareTo(p.getValue()) < 0)
          q = p.getLeft();
        else
          q = p.getRight();
      }
    }

    if (item.compareTo(p.getValue()) < 0)
      p.setLeft(new TreeNode(item));
    else
      p.setRight(new TreeNode(item));
  }

  public TreeNode find(Comparable key) {
    return null;
  }
}