二叉树的常用三种遍历

struct BTNode{
	int data;
	struct BTNode *lchild, *rchild;
};
typedef struct BTNode  BTnode;
typedef struct BTNode* BiTree;

void preOrder(BTNode *root){
	if (root == NULL){
		return;
	}
	printf("%d",root->data);
	//遍历左子树
	preOrder(root->lchild);
	//遍历右子树
	preOrder(root->rchild);
}
void inOrder(BTNode *root){//中序遍历
	if (root == NULL){
		return;
	}
	//遍历左子树
	preOrder(root->lchild);
	printf("%d", root->data);
	//遍历右子树
	preOrder(root->rchild);
}
void postOrder(BTNode *root){//后序遍历
	if (root == NULL){
		return;
	}
	//遍历左子树
	preOrder(root->lchild);
	
	//遍历右子树
	preOrder(root->rchild);
	printf("%d", root->data);
}
int _tmain(int argc, _TCHAR* argv[])
{
	BTNode t1, t2, t3, t4, t5;
	memset(&t1,0,sizeof(BTNode));
	memset(&t2, 0, sizeof(BTNode));
	memset(&t3, 0, sizeof(BTNode));
	memset(&t4, 0, sizeof(BTNode));
	memset(&t5, 0, sizeof(BTNode));

	t1.data = 1;
	t2.data