What are binary search trees in C++?

Can you explain what a binary search tree is in C++?

A binary search tree (BST) is a data structure that maintains sorted data for efficient insertion, deletion, and lookup.

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

You can implement a BST by creating a Node structure and defining functions for insertion, deletion, and traversal.

What are the advantages of using a binary search tree?

BSTs allow for average-case O(log n) time complexity for search operations, making them efficient for sorted data.

Can you show me a simple code example of a binary search tree?

Sure! Here's a basic implementation:

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

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

This code defines a Node structure and an insert function.