二叉树的遍历和输出

#include "stdio.h"
#include "stdlib.h"

#define num 100

typedef char DataType;
typedef struct node
{
DataType data;
struct node * lchild,* rchild;
}BinTNode;
typedef BinTNode * BinTree;

 

int found;
BinTNode *p;

BinTree CreateBinTree(BinTree bt)
{
BinTNode * Q[num];
BinTNode * s;
int front,rear;
char ch;
ch=getchar();
bt=NULL;
front=1;
rear=0;
while(ch!='#')
{
s=NULL;
if(ch!='@')
{
s=(BinTNode *)malloc(sizeof(BinTNode));
s->data=ch;
s->lchild=s->rchild=NULL;
}
rear++;
Q[rear]=s;
if(rear==1)
bt=s;
else
{
if(s!=NULL && Q[front]!=NULL)
if(rear % 2==0)
Q[front]->lchild=s;
else
Q[front]->rchild=s;
if(rear % 2!=0)
front++;
}
ch=getchar();
}
return bt;
}

void out(BinTree bt)
{
if(bt!=NULL)
{
printf("%c",bt->data);
out(bt->lchild);
out(bt->rchild);
}
}

void main()
{
BinTree bt;
int xz=1;

while(xz)
{
printf(" 二叉树的遍历和求结点路径 n");
printf("============================n");
printf(" 1. 建立二叉树存储结构 n");
printf(" 2. 输出二叉树 n");
printf(" 0. 退 出 系 统 n");
printf("============================n");
printf(" 请 选 择 ： 0-2 ");
scanf("%d",&xz);
switch(xz)
{
case 1:
printf("输入二叉树的按层结点值（按完全二叉树）：n");
bt=CreateBinTree(bt);
printf("二叉树的链式存储结构完成！n");
break;
case 2:
printf("该二叉树为：n");
out(bt);
break;
}
}
}