算法填空二叉搜索树的查找——递归算法:bool Find(BTreeNode* BST,ElemType& item){if (BST==NULL)return false; //查找失败else {if (item==BST->data){item=BST->data;//查找成功return ­­­­­­­­­___________;}else if(itemdata)return Find(______________,item);else return Find(_______________,item);}//if}