listing continued /public node find(int key/find node with given key /(assumes non-empty treenode current root/start at root while(current idata !key/while no matchif(key current idata/go leftcurrent current leftchildelse /or go rightcurrent current rightchildif(current =null/if no childreturn null/didn' find it return current/found it /end find(/public void insert(int iddouble ddnode newnode new node()/make new node newnode idata id/insert data newnode ddata ddif(root==null/no node in root root newnodeelse /root occupied node current root/start at root node parentwhile(true/(exits internallyparent currentif(id current idata/go leftcurrent current leftchildif(current =null/if end of the line/insert on left parent leftchild newnodereturn/end if go left else /or go right