树的遍历C语言实现代码
#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 100
typedef char elemtype;
typedef struct bitree
{
elemtype data;
struct bitree *lchild,*rchild;
}BTREE;
BTREE *create()
{
BTREE *q[100];
BTREE *s;
BTREE *root ;
int front=1,rear=0,i;
char ch;
root=NULL;
for(i=0;i<100;i++)
q[i]=NULL;
printf("请按层次依次输入二叉树中的结点:\n");
printf("空结点以逗号代替,以#号结束!\n");
ch=getchar();
while(ch!='#')
{
s=NULL;
if(ch!=',')
{
s=(BTREE *)malloc(sizeof(BTREE)); s->data=ch;
s->lchild=NULL; s->rchild=NULL;
}
rear++;
q[rear]=s;
if(rear==1)
root=s;
else
{
if((s!=NULL)&&(q[front]!=NULL)