数据结构二叉树代码（未完成）

二叉树的先序构造和遍历

#include
#include
using namespace std;
#define N 100
typedef struct BiTNode
{
	char data;
	struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;

BiTree Create_Pre(BiTree &T)
{
	char c;
	cin>>c;
	if(c != '0') {
		T = (BiTree) malloc (sizeof (BiTNode));
		T->data = c;
		Create_Pre(T->lchild);
		Create_Pre(T->rchild);
	}else {
		T = NULL;
	}
	
	return T;
}

void PreOrder(BiTree T)
{
	if(T){
		cout<data<<" ";
		PreOrder(T->lchild);
		PreOrder(T->rchild);
	}
}
int main()
{
	BiTree T;
	Create_Pre(T);
	PreOrder(T);
	return 0;
}
/*
3 2 9 0 0 4 0 0 7 0 0



*/