Binary Search Tree(BST)

Adding Node to Tree:

public void buildTree(int tData) {
Node1 newNode1 = new Node1(tData);
if (root == null)
root = newNode1;
else {
Node1 current = root;
Node1 parent;
while (true) {
parent = current;
if (tData < current.tData)// go left
{
current = current.lefNode1;
if (current == null) {
parent.lefNode1 = newNode1;
return;
}
} else {
current = current.rightNode1;
if (current == null) {
parent.rightNode1 = newNode1;
return;
}
}
}
}
}

Check if Node is present in Node:

boolean isPresent(int tData){
if(root==null)
System.out.println(" error ");
else{
Node1 current = root;
while(current!=null && current.tData  != tData){
if(current.tData > tData)
current = current.lefNode1;
else if(current.tData < tData)
    current = current.rightNode1;
}
if(current!=null)return true;
}
return false;
}

Find Maimum Element in BST( with Recursion):

public int findMaxBT(Node1 node) {
Node1 current = node;
while (current.rightNode1 != null) {
current = current.rightNode1;
}
return current.tData;
}