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

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

To implement a binary tree in C++, you can start by defining a node structure. Each node should have a value and pointers to its left and right children.

Can you show me a simple code example?

Sure! Here's a basic example:

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

Node* createNode(int value) {
    Node* newNode = new Node();
    newNode->data = value;
    newNode->left = nullptr;
    newNode->right = nullptr;
    return newNode;
}

How do I insert a value into the binary tree?

You can create a function to insert values recursively. Here's a simple implementation:

void insert(Node*& root, int value) {
    if (root == nullptr) {
        root = createNode(value);
    } else if (value < root->data) {
        insert(root->left, value);
    } else {
        insert(root->right, value);
    }
}

What about traversing the tree?

You can traverse a binary tree using in-order, pre-order, or post-order methods. For example, in-order traversal can be implemented like this:

void inOrder(Node* root) {
    if (root != nullptr) {
        inOrder(root->left);
        std::cout << root->data << " ";
        inOrder(root->right);
    }
}