c语言建树用那种方法,C语言建树和操作树的定义和函数吗？

湖上湖

大多数问题是函数名字写错 了。#include#include#define OK 1#define ERROR 0#define OVERFLOW -1typedef int Status;typedef char TElemType;typedef struct BiTNode{TElemType data;struct BiTNode *lchild,*rchild;}BiTNode,*BiTree;Status CreateBitree(BiTree T);Status PreOrder(BiTree T);Status InOrder(BiTree T);Status CreateBitree(BiTree T){char ch;scanf("%c",&ch);if(ch=='#')T=NULL;else{T=(BiTree)malloc(sizeof(BiTNode));if(!T);exit(OVERFLOW);T->data=ch;CreateBitree(T->lchild);CreateBitree(T->rchild);}return OK;}Status PreOrder(BiTree T){if(T){printf("%c",T->data);PreOrder(T->lchild);PreOrder(T->rchild);}return OK;}Status InOrder(BiTree T){if(T){InOrder(T->lchild);printf("%c",T->data);InOrder(T->rchild);}return OK;}Status PostOder(BiTree T){if(T){PostOder(T->lchild);PostOder(T->rchild);printf("%c",T->data);}return OK;}int main(){BiTree T={'\0'};printf("先序建树：依次输入二叉树结点号，孩子为空时输入空格\n");CreateBitree(T);printf("\n先序遍历二叉树为：");PreOrder(T);printf("\n中序遍历二叉树为：");InOrder(T);printf("\n后序遍历二叉树为：");PostOder(T);return 0;}