package binarytree;

public class BinaryTree {

	private BTClass root;
	
	public BinaryTree(){
        root = null;
    }
	public boolean search(){
		if(root != null){
			return root != null;
		}
		return root == null;
	}
}

@@ -230,11 +230,456 @@
 l;%0D%0A%09%7D%0D%0A
+%09public void insert(int data)%7B%0D%0A%09%09insert(root, data);%0D%0A%09%7D%0D%0A%09private void insert(BTClass node, int data)%7B%0D%0A%09%09if (data %3C= node.getData())%7B%0D%0A    %09%09if(node.left != null)%7B%0D%0A    %09%09%09insert(node.left, data);%0D%0A    %09%7Delse%7B%0D%0A    %09%09node.left = new BTClass(data);%0D%0A    %7D%0D%0A    %09%7Delse if(data %3E node.getData())%7B%0D%0A    %09%09if( node.right != null)%7B%0D%0A    %09%09%09insert(node.right, data);%0D%0A    %09%09%7Delse%7B%0D%0A    %09%09%09node.right = new BTClass(data);%0D%0A    %09%09%7D%0D%0A    %09%7D%0D%0A    %7D%0D%0A%09%0D%0A
 %7D%0D%0A

Insert done my guy