链二叉树先序读入

 #include <iostream>
using namespace std;

typedef int TElemType;
const INIT_SIZE = 100;
const INCREAMENT_SIZE = 10;

typedef struct TNode
{
 TElemType data;
 TNode * lChild, *rChild;
}TNode,* BiTree;

int CreateBiTree(BiTree & T)
{
 int data;
 scanf("%d",&data);
 if(!data)
  T = NULL;
 else
 {
  if(!(T = (TNode *)malloc(sizeof(TNode))))
   exit(0);
  T->data = data;
  CreateBiTree(T->lChild);
  CreateBiTree(T->rChild);
 }
 return 1;
}

int main()
{
 freopen("in.txt","r",stdin);
 BiTree T;
 CreateBiTree(T);
 return 0;
}

 

 

//in.txt   1 2 4 0 0 5 0 0 3 6 0 0 7 0 0