如何结合findMin(）和delete(）来删除BST中的最小节点

我有一个递归删除给定节点的recMove函数。我还有一个findMin函数，可以查找BST中的最小节点。我在合并两者时遇到问题，以便我可以删除最小(或最大(节点。这是我尝试做的，但它只是返回垃圾：完整代码：https://pastebin.com/HCVsUZ4S

//remove min node in BST
node * extractMin() 
{
    return recRemove(root, findMin(root));
}
//delete node from tree
node * recRemove(node * root, double data)
{
    //3 cases: no children, one child, 2 children
    if (root == NULL)
    {
        return NULL;
    }
    else if (data < root->data)
    {
        root->left = recRemove(root->left, data);
    }
    else if(data > root->data)
    {
        root->right = recRemove(root->right, data);
    }
    else
    {
        if (root->right == NULL && root->left == NULL) //no children
        {
            delete root;
            root = NULL;
            return root;
        }
        else if(root->left == NULL) //only right child
        {
            temp = root;
            root = root->right;
            delete temp;
            return root;
        }
        else if(root->right == NULL) //only left child
        {
            temp = root;
            root = root->left;
            delete temp;
            return root;
        }
        else //2 children
        {
            temp->data = findMin(root->right);
            root->data = temp->data;
            root->right = recRemove(root->right, temp->data);
        }
    }
    return root;
}
//find min node in BST
double findMin(node * p)
{
    if(p == NULL)
    {
        return -1;
    }
    else
    {
        //in a balanced BST the minimum node is the leftmost node so,
        //we traverse the left subtree until we get to the leftmost node and return and remove it.
        temp = p;
        while(temp->left != NULL)
        {
            temp = temp->left;
        }
        return temp->data;
    }
}