C语言实现二叉树的层序遍历

贴代码：

#include<stdio.h>
#include<stdlib.h>

#define OK 1
#define ERROR 0
#define MAXSIZE 10

//定义二叉树
typedef struct BiNode {
   
   
	char data;
	struct BiNode* lchild, * rchild;
}BiNode,*BiTree;

//定义循环队列
typedef struct {
   
   
	BiTree data[MAXSIZE];
	int front;
	int rear;
}Queue;

//初始化队列
int InitQueue(Queue* Q)