Удаление элементов из двоичного дерева поиска

void deleteElement(Tree *&root, int valueForDelete)
{
    Tree *elementForDelete = search(root, valueForDelete);
 
    if ((elementForDelete->leftChild == nullptr) && (elementForDelete->rightChild == nullptr))
    {
        elementForDelete = nullptr;
        delete elementForDelete;
        return;
    }
 
    if (elementForDelete->leftChild == nullptr)
    {
        Tree *oldElement = elementForDelete;
        elementForDelete = elementForDelete->rightChild;
        delete oldElement;
        return;
    }
 
    if (elementForDelete->rightChild == nullptr)
    {
        Tree *oldElement = elementForDelete;
        elementForDelete = elementForDelete->leftChild;
        delete oldElement;
        return;
    }
    
    Tree *newElementForDelete = elementForDelete->rightChild;
    while (newElementForDelete->leftChild != nullptr)
    {
        newElementForDelete = newElementForDelete->leftChild;
    }
    
    elementForDelete->value = newElementForDelete->value;
    newElementForDelete->value = valueForDelete;
    deleteElement(root, valueForDelete);
}