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

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

To implement a tree structure in C++, you can define a node class that contains data and pointers to its children.

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

Sure! Here's a basic example:

class Node {
public:
    int data;
    Node* left;
    Node* right;
    Node(int val) : data(val), left(nullptr), right(nullptr) {}
};

class BinaryTree {
public:
    Node* root;
    BinaryTree() : root(nullptr) {}
};

This defines a simple binary tree node and a tree class.

How do I add nodes to this binary tree?

You can create a method to insert nodes. For example:

void insert(Node*& node, int val) {
    if (node == nullptr) {
        node = new Node(val);
    } else if (val < node->data) {
        insert(node->left, val);
    } else {
        insert(node->right, val);
    }
}