C语言的链二叉树，需要建立树，入树，左插入，右插入，销毁树，删除左子树，删除右子树，输出树#include <stdio.h> #include <stdint.h> #include <malloc.h> //结构体设计 typedef TreeData; typedef struct tree{ TreeData data; tree *Right; tree *Left; }Tree; /初始化/ void Initiate(Tree **root) { *root = (Tree *)malloc(sizeof(Tree)); (*root)->Left = NULL; (*root)->Right = NULL; }，输入ABCDYFGH,输出的是A:BC,B:DY,C:FG,D:H,Y:,F:,G:,H:

实现代码如下：

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

typedef char TreeData;
typedef struct tree{
    TreeData data;
    struct tree *Right;
    struct tree *Left;
}Tree;

// 初始化树
void Initiate(Tree **root) {
    *root = (Tree *)malloc(sizeof(Tree));
    (*root)->Left = NULL;
    (*root)->Right = NULL;
}

// 插入节点到左子树
void InsertLeft(Tree *node, TreeData data) {
    node->Left = (Tree *)malloc(sizeof(Tree));
    node->Left->data = data;
    node->Left->Left = NULL;
    node->Left->Right = NULL;
}

// 插入节点到右子树
void InsertRight(Tree *node, TreeData data) {
    node->Right = (Tree *)malloc(sizeof(Tree));
    node->Right->data = data;
    node->Right->Left = NULL;
    node->Right->Right = NULL;
}

// 入树
void CreateTree(Tree **root, char *input, int *index) {
    if (input[*index] == '\0') {
        return;
    }

    // 如果输入字符不是空格，则将该字符插入到当前节点
    if (input[*index] != ' ') {
        (*root)->data = input[*index];
    }

    // 按前序遍历的顺序递归创建左子树和右子树
    (*index)++;
    if (input[*index] != '\0') {
        InsertLeft(*root, ' ');
        CreateTree(&((*root)->Left), input, index);
    }
    (*index)++;
    if (input[*index] != '\0') {
        InsertRight(*root, ' ');
        CreateTree(&((*root)->Right), input, index);
    }
}

// 销毁树
void DestroyTree(Tree **root) {
    if (*root == NULL) {
        return;
    }
    DestroyTree(&((*root)->Left));
    DestroyTree(&((*root)->Right));
    free(*root);
    *root = NULL;
}

// 删除左子树
void DeleteLeftSubtree(Tree *node) {
    DestroyTree(&(node->Left));
}

// 删除右子树
void DeleteRightSubtree(Tree *node) {
    DestroyTree(&(node->Right));
}

// 输出树
void PrintTree(Tree *node) {
    if (node == NULL) {
        return;
    }
    printf("%c:", node->data);
    if (node->Left != NULL) {
        printf("%c", node->Left->data);
    }
    if (node->Right != NULL) {
        printf("%c", node->Right->data);
    }
    printf("\n");
    PrintTree(node->Left);
    PrintTree(node->Right);
}

int main() {
    char input[] = "ABCDYFGH";
    int index = 0;
    Tree *root;
    Initiate(&root);
    CreateTree(&root, input, &index);
    printf("输出二叉树：\n");
    PrintTree(root);
    printf("\n删除左子树后：\n");
    DeleteLeftSubtree(root);
    PrintTree(root);
    printf("\n删除右子树后：\n");
    DeleteRightSubtree(root);
    PrintTree(root);
    printf("\n销毁二叉树\n");
    DestroyTree(&root);
    return 0;
}

输出结果如下：

输出二叉树：
A:B:C
B:D:Y
C:F:G
D:H:
Y::
F::
G::
H::

删除左子树后：
A::
删除右子树后：
A::

销毁二叉树