How do I delete a node from a binary search tree in C++?

How do I delete a node from a binary search tree in C++?

To delete a node from a binary search tree in C++, you need to consider three cases: deleting a leaf node, deleting a node with one child, and deleting a node with two children. Which case are you dealing with?

I'm dealing with a node that has two children.

In that case, you need to find the node's in-order successor (the smallest node in the right subtree), replace the node's value with the successor's value, and then delete the successor. Would you like a code example?

Yes, please provide a code example.

Here's a simple implementation:

struct Node {
    int key;
    Node* left;
    Node* right;
};

Node* deleteNode(Node* root, int key) {
    if (root == nullptr) return root;
    if (key < root->key) {
        root->left = deleteNode(root->left, key);
    } else if (key > root->key) {
        root->right = deleteNode(root->right, key);
    } else {
        // Node with one child or no child
        if (root->left == nullptr) {
            Node* temp = root->right;
            delete root;
            return temp;
        } else if (root->right == nullptr) {
            Node* temp = root->left;
            delete root;
            return temp;
        }
        // Node with two children
        Node* temp = minValueNode(root->right);
        root->key = temp->key;
        root->right = deleteNode(root->right, temp->key);
    }
    return root;
}

Let me know if you need further clarification!

Thanks! That helps a lot.