You'll need two classes:
1. Tree
and
2. Node
The Tree class will just need one instance variable
private Node root = null;
In the Tree class, everything can be pretty simple for each different kind of operation whether it be insert(), delete(), or find().
First check if root is null, if so immediately return the appropriate result. For example, for a find() if the root is null, return a null Integer. (declare all of your integers using the object type Integer so that you can return null in cases like this.)
Next, root isn't null, so you can make calls like:
return root.find();
return root.insert();
etc.
Then for Node, you would also declare find() insert() etc.
I may be loosing you. If you want to chat me up on Yahoo! Messenger, I can walk you through it. My Yahoo! Messenger ID is: "kaydell" and my email address is: "kaydell@yahoo.com"