public TreeNode insertIntoBST(TreeNode root, int val) {
TreeNode tNode = new TreeNode(val);
TreeNode current = root;
while(true){
if(val > current.val){
//BIGGER
if(current.right == null){//insert
current.right = tNode;
break;
}
current = current.right;
}else{
//SMALLER
if(current.left == null){//insert
current.left = tNode;
break;
}
current = current.left;
}
}
return root;
}