树结构 - 孩子不正确

这种行为的原因是您使用范围内的范围变量。您不得使用指向该范围范围变量指向范围变量的指针。范围变量仅在范围内就存在。如果决定从范围访问示波器变量，您将访问一些堆栈，这些堆栈将覆盖其他数据，从而导致不确定的行为。

我的意思是，您一定不能这样做：

if (root == NULL) 
{
    Node new_node;
    root = &new_node;
    return;
}

您可以使用操作员 new 在堆中创建struct node 的新实例并稍后使用。

if (root == NULL) 
{
    root = new Node;
    return;
}

，但是您稍后必须删除此节点。或者您可以使用智能指针，请参阅此。

阅读此信息，以获取更多信息。

下面的代码可以完成您的期望。但是，它不会删除创建会导致内存泄漏的节点，因此必须改进此代码，但这是一个单独的问题。

#include <numeric>
#include <vector>
#include <cstdio>
#include <cstdlib>
using namespace std;
struct Node {
    Node* left;
    Node* right;
    Node* parent;
    int value;
    int count_leafs;
    int height;
};
Node* root;

void insert2(int p, int value, Node* node, int left)
{
    //printf("insert %d %d - (%d, %d) %d n", p, value, node->left, node->right, left);
    if (root == NULL) {
        //  creating a tree root
        Node* new_node = new Node;
        new_node->left = NULL;
        new_node->right = NULL;
        new_node->parent = NULL;
        root = new_node;
        root->value = value;
        root->count_leafs = 1;
        root->height = 1;
        return;
    }
    if (node->left == NULL && node->right == NULL) {
        //  joining value to the leaf
        Node* new_parent = new Node;
        new_parent->count_leafs = 2;
        new_parent->height = 2;
        new_parent->value = node->value + value;
        new_parent->parent = node->parent;
        new_parent->left = NULL;
        new_parent->right = NULL;
        Node* new_leaf = new Node;
        new_leaf->value = value;
        new_leaf->count_leafs = 1;
        new_leaf->left = NULL;
        new_leaf->right = NULL;
        new_leaf->height = 1;
        new_leaf->parent = new_parent;
        new_parent->left = new_leaf;
        new_parent->right = node;

        if (node->parent != NULL && node->parent->left != NULL && node->parent->left == node) {
            printf("a");
            node->parent->left = new_parent;
        }
        if (node->parent != NULL && node->parent->right != NULL && node->parent->right == node) {
            printf("b");
            node->parent->right = new_parent;
        }
        node->parent = new_parent;
        return;
    }
    //printf("GOTO: %d %d n", left + node->left->count_leafs, p);
    node->value += value;
    node->count_leafs += 1;
    if (left + node->left->count_leafs + 1 >= p) {
        //printf("W leftn");
        insert2(p, value, node->left, left);
    }
    else {
        //printf("W rightn");
        insert2(p, value, node->right, left + node->left->count_leafs);
    }
}

void insert(int p, int value)
{
    insert2(p, value, root, 0);
}
int main()
{
    Node new_root;
    root = NULL;
    new_root.value = 10;
    new_root.height = 2;
    new_root.count_leafs = 2;
    new_root.parent = NULL;
    root = &new_root;
    Node left;
    left.value = 6;
    left.height = 1;
    left.count_leafs = 1;
    left.parent = root;
    left.left = NULL;
    left.right = NULL;
    Node right;
    right.value = 4;
    right.height = 1;
    right.count_leafs = 1;
    right.parent = root;
    right.left = NULL;
    right.right = NULL;
    root->left = &left;
    root->right = &right;
    // PLACE A
    insert(0, 1);
    // PLACE B
    return 0;
}