动态插入节点

最新推荐文章于 2022-05-08 23:47:42 发布

Function_18

最新推荐文章于 2022-05-08 23:47:42 发布

阅读量505

点赞数

分类专栏：树

本文链接：https://blog.csdn.net/Function_Dou/article/details/76093030

版权

树专栏收录该内容

5 篇文章 0 订阅

订阅专栏

输入L, R来放入带插入的二叉树中, 如:LLLL代表将数插入到左左左左的位置, LRLRLR也同理, 只需要将输入的放在字符串中一个一个读取即可

T Inset(T node, char *ch, int i, int num)
{
    if (node == NULL)
        node = new Node();

    i++;
    if (ch[i] == 'L')
        node->L = Inset(node->L, ch, i, num);
    else if (ch[i] == 'R')
        node->R = Inset(node->R, ch, i, num);

    if (ch[i] == '\0')
    {
        node->num = num;
        num = 0;
    }

    return node;
}

虽然很简单,但是很容易出错, 这里有两个做的时候犯的错误, 也希望能懂错在哪里, 不知道可以调试来看看

/*
T Inset(T node, char *ch, int i, int num)
{
    if (node == NULL)
        Creat(node, 0);

    if (ch[i] == 'L')
        node->L = Inset(node->L, ch, ++i, num);
    else if (ch[i] == 'R')
        node->R = Inset(node->R, ch, ++i, num);

    if (ch[i] == '\0')
    {
        node->num = num;
        num = 0;
    }

    return node;
}
*/
/*
T Inset(T node, char *ch, int i, int num)
{
    if (node == NULL)
        Creat(node, 0);

    if (ch[i] == 'L')
        node->L = Inset(node->L, ch, i++, num);
    else if (ch[i] == 'R')
        node->R = Inset(node->R, ch, i++, num);

    if (ch[i] == '\0')
    {
        node->num = num;
        num = 0;
    }

    return node;
}
*/

源代码

/*
L:左
R:右
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct Node;
typedef struct Node *T;
struct Node
{
    int num;
    T L;
    T R;
    Node() : num(0), L{ NULL }, R(NULL) {}
};

/*
void Creat(T &node, int num)
{
if (node == NULL)
{
node = (T)malloc(sizeof(struct Node));
if (node == NULL)
exit(0);
node->num = num;
node->L = node->R = NULL;
}
}
*/

T Inset(T node, char *ch, int i, int num)
{
    if (node == NULL)
        node = new Node();

    i++;
    if (ch[i] == 'L')
        node->L = Inset(node->L, ch, i, num);
    else if (ch[i] == 'R')
        node->R = Inset(node->R, ch, i, num);

    if (ch[i] == '\0')
    {
        node->num = num;
        num = 0;
    }

    return node;
}

void P(T node)
{
    if (node != NULL)
    {
        printf("%d ", node->num);
        P(node->L);
        P(node->R);
    }
}


int main()
{
    T node = NULL;
    int i = 0;
    char a[10];
    scanf("%s", a);
    node = Inset(node, a, i - 1, 5);
    scanf("%s", a);
    node = Inset(node, a, i - 1, 4);

    P(node);

    system("pause");
    return 0;
}