Driver already given. Please help

public class TreeNode implements Comparable{

private int data;

private TreeNode left;

private TreeNode right;

public TreeNode(int data){

this.data=data;

left=right=null;

}

public int getData(){

return data;

}

public TreeNode getLeft(){

return left;

}

public TreeNode getRight(){

return right;

}

public void setData(int data){

this.data = data;

}

public void setLeft(TreeNode left){

this.left = left;

}

public void setRight(TreeNode right){

this.right = right;

}

public int compareTo(TreeNode node){

return data-node.getData();

}

}

import java.util.*;

public class MyTree{

private TreeNode root;

public MyTree(){

root=null;

}

public boolean isEmpty(){ return root==null;}

public int size(){

return sizeHelper(root);

}

private int sizeHelper(TreeNode node){

if(node==null) return 0;

else return 1+sizeHelper(node.getLeft())+sizeHelper(node.getRight());

}

public boolean search(int data){

return searchHelper(root, data);

}

private boolean searchHelper(TreeNode node, int data){

if(node==null) return false;

if(node.getData()==data) return true;

else if(node.getData()

return searchHelper(node.getRight(),data);

else

return searchHelper(node.getLeft(), data);

}

public void add(int data){

root=addHelper(root, data);

//if(root==null) root =new TreeNode(data);

//else addHelper2(root, data);

}

private void addHelper2(TreeNode n, int data){

if(data

if(n.getLeft()==null){

n.setLeft(new TreeNode(data));

}else{

addHelper2(n.getLeft(),data);

}

}else{

if(n.getRight()==null)

n.setRight(new TreeNode(data));

else

addHelper2(n.getRight(),data);

}

}

private TreeNode addHelper(TreeNode node, int data){

if(node==null) node=new TreeNode(data);

else if(data

node.setLeft(addHelper(node.getLeft(), data));

else

node.setRight(addHelper(node.getRight(), data));

return node;

}

public void display(){

displayHelper(root, 0);

}

private void displayHelper(TreeNode t, int level){

if(t==null) return ;

displayHelper(t.getRight(), level + 1);

for(int k = 0; k

System.out.print("\t");

System.out.println(t.getData());

displayHelper(t.getLeft(), level + 1); //recurse left

}

private void displayHelper2(TreeNode t, int level){

if(t==null) return ;

displayHelper2(t.getRight(), level + 1);

for(int k = 0; k

System.out.print(" ");

System.out.println(t.getData());

displayHelper2(t.getLeft(), level + 1); //recurse left

}

private TreeNode getMaxNode(TreeNode tree){

while(tree.getRight() !=null)

tree=tree.getRight();

return tree;

}

//remove a node from the tree

public void delete(int data){// implement this method

}

public int height(){ //implement this method

}

public MyTree balance(){ //implement this method

}

}

TreeDriver.class: Results height 3 300 85 10 After deleting 300: height- 2 85 10 6 Test balancing method Tree before balancing: 9 Ec