二叉树的递归遍历

//按照先序遍历的方法建立一颗二叉树
include<iostream>
#include<iomanip>
using namespace std;
#define OK 1
#define ERROR 0
typedef char  TElemType;
typedef int Status;
typedef struct BiTNode {
	TElemType data;
	struct BiTNode *lchild, *rchild, *parent;
}BiTNode, *BiTree;
Status PreOrderTree(BiTree T);
Status CreateBiTree(BiTree &T);//按先序次序输入二叉树中节点的值(一个字符),空格字符表示空数
Status PreOrderTraverse(BiTree T, Status(*PrintElement)(TElemType));//先序遍历
Status InOrderTraverse(BiTree T, Status(*PrintElement)(TElemType));//中序遍历
Status PostOrderTraverse(BiTree T, Status(*PrintElement)(TElemType));//后续遍历
Status PrintElement(TElemType e);
Status CreateBiTree(BiTree &T) {
	char ch = 0;
	ch = getchar();
	if (ch == '*')//*号代表节点为空
		T = NULL;
	else {
		if (!(T = (BiTree)malloc(sizeof(BiTNode))))
			exit(0);
		else {
			T->data = ch;
			CreateBiTree(T->lchild);
			CreateBiTree(T->rchild);
		}
	}
	return OK;

}

Status InOrderTraverse