数据结构二叉树的实现出现问题,求解答
#include <stdio.h>
#include <stdlib.h>
#define OK 0
typedef struct Treenode
{
char data;
struct Treenode *lchild,*rchild;
}Tnode,*TNODE;
int CreateTree(TNODE *T){
(*T) = (TNODE)malloc(sizeof(Tnode));
if(getchar()!=' '){
char n = getchar();
(*T)->data = n;
CreateTree((*T)->lchild);
CreateTree((*T)->rchild);
}
else if(getchar() == ' '){
(*T) = NULL;
}
return OK;
}
int PreOrderTraverse(TNODE *T){
printf((*T)->data);
PreOrderTraverse((*T)->lchild);
PreOrderTraverse((*T)->rchild);
return OK;
}
int main(){
TNODE T;
CreateTree(&T);
PreOrderTraverse(&T);
}