二叉树的遍历代码（递归）

#include "stdio.h"
#include "string.h"
#include <stdlib.h>
#define NULL 0

typedef struct BiTNode{
    char data;
    struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;

BiTree Create(BiTree T){
    char ch;
    ch=getchar();
    if(ch=='@')
T=NULL;
    else{
if(!(T=(BiTNode *)malloc(sizeof(BiTNode))))
printf("Error!");
T->data=ch;
T->lchild=Create(T->lchild);
T->rchild=Create(T->rchild);
    }
    return T;
}
void Preorder(BiTree T){
if(T){
printf("%c",T->data);
Preorder(T->lchild);