package assignment1;

public class BinarySearchTree {

	public BinarySearchTree() {
		// TODO Auto-generated constructor stub
	}

	public void insert(int value) {
		// TODO implement
	}
	
	public boolean find(int value) {
		// TODO implement
		return false;
	}
}

@@ -47,18 +47,41 @@
 hTree %7B%0A
-%0A%09
+  private Node root;%0A%0A   
 public B
@@ -103,184 +103,938 @@
 () %7B
-%0A%09%09// TODO Auto-generated constructor stub%0A%09%7D%0A%0A%09
+ %0A   this.root=null;%0A   %7D  %0A   public void insert(int value)%7B%0A    root=insert(root,value);%0A %7D%0A   %0Apublic class Node%0A   %7B%0A      public int value;%0A      public Node right;%0A      public Node left;%0A      %0A  public Node(int value)%7B%0A  this.value=value;%0A  this.right=null;%0A  this.left=null;%0A  %7D%0A      %7D%0A%0A 
 public 
-void insert(int value) %7B%0A%09%09// TODO implement%0A%09%7D%0A%09%0A%09public boolean find(int value) %7B%0A%09%09// TODO implement%0A%09%09return false;%0A%09%7D
+Node insert(Node treeNode,int value)%7B%0Aif(treeNode==null)%7B%0A    treeNode=new Node(value);%0A%7D%0Aelse%7B%0A    if(value%3E=treeNode.value)%7B%0A        treeNode.right=insert(treeNode.right,value);%0A        %7D%0A    else%7B%0A        treeNode.left=insert(treeNode.left,value);%0A    %7D%0A%7D%0Areturn treeNode;%0A %7D%0A %0A     %0A %0A %0Apublic boolean find(int value)%7B%0A   Node findTreeNode=root;%0A   if(findTreeNode.value==value)%7B%0A       return true;%0A %7D%0A else%7B%0A       if(value%3EfindTreeNode.value)%7B%0A           findTreeNode=findTreeNode.right;%0A           return true;%0A       %7D%0A       else%7B%0A           findTreeNode=findTreeNode.left;%0A           return true;%0A       %7D%0A   %7D %0A %7D%0A
 %0A%7D%0A

Update BinarySearchTree.java