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

#include<iostream>
using namespace std;
#define MaxSize 100
typedef struct BiTNode
{
	char data;
	struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;
typedef struct
{
	BiTree 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.rear == Q.front)
		return false;
	else
	{
		p = Q.data[Q.front];
		Q.front = (Q.front + 1) % MaxSize;
	}
}
void Creatbitree(BiTree& T, char e)
{
	if (!T)
	{
		T = new BiTNode;
		T->data = e;
		T->lchild = NULL;
		T->rchild = NULL;
	}
	else if (T->data < e)
		Creatbitree(T->rchild, e);
	else if (T->data > e)
		Creatbitree(T->lchild, e);
}
bool IsComplete(BiTree T)
{
	if (!T)
		return true;
	else
	{
		SqQueue Q;
		InitQueue(Q);
		BiTree p = T;
		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;
}
int main()
{
	BiTree T = NULL;
	SqQueue Q;
	char s[100];
	cin >> s;
	for (int i = 0; i < strlen(s); i++)
	{
		Creatbitree(T, s[i]);
	}
	if (IsComplete(T))
		cout << "是" << endl;
	else
		cout << "否" << endl;
	return 0;
}