Node current=root;
        Node last=root;
        while(current!=null){
            last=current;
            if(current.data<value)current=current.right;
            else current=current.left;
        }
    Node temp=new Node();
    temp.data=value;
    if(root==null)return temp;
    
    
    if(last.data<value)last.right=temp;
    else last.left=temp;
    
    return root;