二叉树层次遍历与递归释放

<pre name="code" class="cpp">void LevelOrder(BTNode *b){BTNode *p;BTNode *qu[MaxSize];int front,rear;front=rear=0;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;}}}void f(BTNode *&b)   //注意这里是指针变量的引用{if(b!=NULL){f(b->lchild);f(b->rchild);free(b);}}