How do I implement a binary search tree in C++?

How do I implement a binary search tree in C++?

To implement a binary search tree in C++, you need to define a node structure and then create functions for insertion, deletion, and traversal.

Can you show me a simple code example for inserting a node?

Sure! Here's a basic example:

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

Node* insert(Node* root, int data) {
    if (root == nullptr) {
        Node* newNode = new Node();
        newNode->data = data;
        newNode->left = newNode->right = nullptr;
        return newNode;
    }
    if (data < root->data) {
        root->left = insert(root->left, data);
    } else {
        root->right = insert(root->right, data);
    }
    return root;
}

This function inserts a new node into the tree.

What about deleting a node? Can you provide that code too?

Certainly! Here's a simple implementation for deleting a node:

Node* deleteNode(Node* root, int data) {
    if (root == nullptr) return root;
    if (data < root->data) {
        root->left = deleteNode(root->left, data);
    } else if (data > root->data) {
        root->right = deleteNode(root->right, data);
    } else {
        // Node with only 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: Get the inorder successor (smallest in the right subtree)
        Node* temp = minValueNode(root->right);
        root->data = temp->data;
        root->right = deleteNode(root->right, temp->data);
    }
    return root;
}

This function handles the deletion of a node from the tree.