【专题三】二叉树层序遍历

void level(BTNode *T)
{
	BTNode *que[maxSize],*p = T; //循环数组
	BTNode *q;//用来接收出队的结点 
	int front,rear;
	front = rear = 0;
	if(p!=NULL)
	{
		rear = (rear+1)%maxSize;
		que[rear] = p;//根结点先入队
		while(front!=rear) //如果队列不为空，则迭代数组内的结点
		{
			front = (front+1)%maxSize;//队首元素出队并输入其值
			q = que[front]; 
			printf("%c ",q->data);
			if(q->lchild!=NULL) //若该元素有左孩子，则将左孩子入队 
			{
				rear = (rear+1)%maxSize;
				que[rear] = q->lchild;
			} 
			if(q->rchild!=NULL) //同样地，若该元素有右孩子，则将右孩子入队 
			{
				rear = (rear+1)%maxSize;
				que[rear] = q->rchild;
			} 
		}	
	}	
}