Ответ:

#include <iostream>

class TreeNode {

public:

int data;

TreeNode* left;

TreeNode* right;

TreeNode(int value) {

data = value;

left = nullptr;

right = nullptr;

}

};

class BinaryTree {

private:

TreeNode* root;

public:

BinaryTree() {

root = nullptr;

}

void insert(int value) {

root = insertRecursive(root, value);

}

TreeNode* insertRecursive(TreeNode* node, int value) {

if (node == nullptr) {

return new TreeNode(value);

}

if (value < node->data) {

node->left = insertRecursive(node->left, value);

} else if (value > node->data) {

node->right = insertRecursive(node->right, value);

}

return node;

}

void inorderTraversal(TreeNode* node) {

if (node != nullptr) {

inorderTraversal(node->left);

std::cout << node->data << " ";

inorderTraversal(node->right);

}

}

void printInorder() {

inorderTraversal(root);

std::cout << std::endl;

}

};

int main() {

BinaryTree tree;

tree.insert(5);

tree.insert(3);

tree.insert(7);

tree.insert(2);

tree.insert(4);

tree.insert(6);

tree.insert(8);

std::cout << "Inorder Traversal:" << std::endl;

tree.printInorder();

return 0;

}