main.cpp:
#include "btree.h"
void LevelOrder(BTNode *b)
{
BTNode *p;
BTNode *qu[MaxSize];
int front,rear;
front=rear=-1;
rear++;
qu[rear]=b;
while (front!=rear)
{
front=(front+1)%MaxSize;
p=qu[front];
printf("%c ",p->data);
if (p->lchild!=NULL)
{
rear=(rear+1)%MaxSize;
qu[rear]=p->lchild;
}
if (p->rchild!=NULL)
{
rear=(rear+1)%MaxSize;
qu[rear]=p->rchild;
}
}
}
int main()
{
BTNode *b1,*b2;
CreateBTNode(b1,"A(B(D,E(H(J,K(L,M(,N))))),C(F,G(,I)))");
printf("二叉树b1: ");
DispBTNode(b1);
printf("\n");
printf("层次遍历序列:\n");
LevelOrder(b1);
printf("\n\n");
DestroyBTNode(b1);
CreateBTNode(b2,"A(B(D,E(H(J,K(L,M(,N)))))");
printf("二叉树b2: ");
DispBTNode(b2);
printf("\n");
printf("层次遍历序列:\n");
LevelOrder(b2);
DestroyBTNode(b2);
return 0;
}