Delete Node in a BST

//Link - https://leetcode.com/problems/delete-node-in-a-bst/


 TreeNode* minNodeValue(TreeNode* root){
    TreeNode* curr = root;
    while(curr && curr->left != NULL){
        curr = curr->left;
    }
    return curr;
    }
         
    
    TreeNode* deleteNode(TreeNode* root, int key) {
        
        if(root == NULL) return root;
    
    if(root->val < key){
        root->right = deleteNode(root->right, key);
    }
    else if(root->val > key) {
        root->left = deleteNode(root->left, key);
    }
    else{
        if(root->left == NULL){
            TreeNode* temp = root->right;
            return temp;
        }
        else if(root->right == NULL){
            TreeNode* temp = root->left;
            return temp;
        }
        TreeNode* temp = minNodeValue(root->right);
        root->val = temp->val;
        root->right = deleteNode(root->right, temp->val);
    }
    return root;
        
    }
};