1.t = malloc(sizeof(tree));

2.t->rchild =createTree();

3.void qianxu(tree *t)

4.zhongxu(t->lchild );//再读左子树

printf("%c",t->data);//先读根结点

zhongxu(t->rchild );//再读右子树

5.houxu(t->lchild );//再读左子树

houxu(t->rchild );//再读右子树

printf("%c",t->data);//先读根结点

6.return 0;

7.n=count(t->lchild)+count(t->rchild)+1;

8.t1->data=t->data;

9.return t1;

10.return m+1;

PS:注意有些语句结尾是没有分号的