判断是否为完全二叉树（c++）

#include<iostream>
using namespace std;
#define MaxSize 100
typedef struct BiTNode
{
	char data;
	struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;
typedef struct
{
	BiTNode* data[MaxSize];
	int front, rear;
}SqQueue;
void InitQueue(SqQueue& Q)
{
	Q.front = Q.rear = 0;
}
bool IsEmpty(SqQueue Q)
{
	if (Q.front == Q.rear)
		return true;
	else
		return false;
}
bool EnQueue(SqQueue& Q, BiTree p)
{
	if ((Q.rear + 1) % MaxSize == Q.front)
		return false;
	else
		Q.data[Q.rear] = p;
	Q.rear = (Q.rear + 1) % MaxSize;
}
bool DeQueue(SqQueue& Q, BiTree& p)
{
	if (Q.front == Q.rear)
		return false;
	else
		p = Q.data[Q.front];
	Q.front = (Q.front + 1) % MaxSize;
}
bool IsComplete(BiTree T)
{
	SqQueue Q;
	InitQueue(Q);
	BiTree p = T;
	if (!p)
		return true;
	else
	{
		EnQueue(Q, p);
		while (!IsEmpty(Q))
		{
			DeQueue(Q, p);
			if (p)
			{
				EnQueue(Q, p->lchild);
				EnQueue(Q, p->rchild);
			}
			else
			{
				while (!IsEmpty(Q))
				{
					DeQueue(Q, p);
					if (p)
						return false;
				}
			}
		}
		return true;
	}
}
void CreatBitree(BiTree& T, char s[], int& i)    //建立二叉链表
{
	if (s[i] == '#')
		T = NULL;
	else
	{
		T = new BiTNode;
		T->data = s[i];
		CreatBitree(T->lchild, s, ++i);
		CreatBitree(T->rchild, s, ++i);
	}
}
int main()
{
	BiTree T;
	char s[200];
	while (cin >> s && s[0] != '#')
	{
		int i = -1;
		CreatBitree(T, s, ++i);
		if (IsComplete(T))
			cout << "是完全二叉树" << endl;
		else
			cout << "不是完全二叉树" << endl;
	}
	return 0;
}