基于C++类分割错误的二叉树插入

// BinaryTreeNode.h
class BinaryTreeNode {
public:
    int data;
    BinaryTreeNode* left;
    BinaryTreeNode* right;
    
    BinaryTreeNode(int value);
};

// BinaryTreeNode.cpp
BinaryTreeNode::BinaryTreeNode(int value) {
    data = value;
    left = nullptr;
    right = nullptr;
}

// BinaryTree.cpp
#include "BinaryTreeNode.h"

void insertNode(BinaryTreeNode* root, int value) {
    if (value < root->data) {
        if (root->left == nullptr) {
            root->left = new BinaryTreeNode(value);
        } else {
            insertNode(root->left, value);
        }
    } else {
        if (root->right == nullptr) {
            root->right = new BinaryTreeNode(value);
        } else {
            insertNode(root->right, value);
        }
    }
}

// main.cpp
#include "BinaryTreeNode.h"

int main() {
    BinaryTreeNode* root = new BinaryTreeNode(5);
    insertNode(root, 3);
    insertNode(root, 7);
    insertNode(root, 2);
    insertNode(root, 4);
    insertNode(root, 6);
    insertNode(root, 8);
    
    // 继续进行其他操作...
    
    return 0;
}