二叉树的建立

#include

using namespace std;

typedef char Elemtype;

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

BiTNode * BuyBiTNode(Elemtype val)
{
BiTNode * s = new BiTNode();
s->data = val;
return s;
}

BiTree CreatBiTree()
{
Elemtype tmp;
scanf("%c",&tmp);
BiTree T = NULL;
if(tmp == ‘#’);
else
{
T = BuyBiTNode(tmp);
T->lchild = CreatBiTree();
T->rchild = CreatBiTree();
}
return T;
}

void PreOrderTraverse(BiTree T)//前序
{
if(!T)return ;
printf("%c",T->data);
PreOrderTraverse(T->lchild);
PreOrderTraverse(T->rchild);
}

int main()
{
PreOrderTraverse(CreatBiTree());
}