二叉树的递归遍历

二叉树的递归遍历

简单递归遍历二叉树.

#include<stdio.h>
#include<stdlib.h>

#define OK 1
#define ERROR 0
#define OVERFLOW -1
#define TRUE 1
#define FALSE 0
#define SIZEINIT 10
#define INCRESIZE 5

typedef int Status;
typedef char TElemType;

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

//前序创建二叉树
void CreateBiTree(BiTree &T){
   
	char ch;
	scanf("%c",&ch);
	if(ch=='#'){
   
		T = NULL;
	}else{
   
		T = (BiTree)malloc