判断是否为完全二叉树

#include <iostream>
#include "queue"
using namespace std;
class BinaryTreeNode
{
public:
int data;
BinaryTreeNode * lc;
BinaryTreeNode * rc;
BinaryTreeNode(int N){data=N;lc=rc=NULL;}
};
class BinaryTree
{
private:
BinaryTreeNode * root;
public:
BinaryTreeNode * Create(BinaryTreeNode *);
void Show();
BinaryTreeNode * GiveRoot(){return root;}
void Judge();
};
BinaryTreeNode * BinaryTree::Create(BinaryTreeNode * p)
{
int num;
cout<<"请输入数据"<<endl;
cin>>num;
if (num!=0)
{
p=new BinaryTreeNode(num);
p->lc=Create(p->lc);
p->rc=Create(p->rc);
}
else
{
p=NULL;
}
root=p;
return p;
}
void BinaryTree::Show()
{
queue<BinaryTreeNode *> q;
BinaryTreeNode * p=root;
if (p)
{
q.push(p);
}
while (!q.empty())
{
p=q.front();
cout<<p->data<<" ";
q.pop();
if (p->lc)
{
q.push(p->lc);
}
if (p->rc)
{
q.push(p->rc);
}
}
cout<<endl;
}
void BinaryTree::Judge()
{
queue<BinaryTreeNode *> q;
BinaryTreeNode * p=root;
int tag=0;
if (p==NULL)
{
cout<<"是完全二叉树"<<endl;
}
else
{
q.push(p);
}
while (!q.empty())
{
p=q.front();
q.pop();
if (p->lc==NULL&&p->rc!=NULL)
{
cout<<"不是完全二叉树"<<endl;
exit(1);
}
if (p->lc)
{
if (tag!=1)
{
q.push(p->lc);
}
else
{
cout<<"不是完全二叉树"<<endl;
exit(1);
}
}
if (p->rc==NULL)
{
tag=1;
}
if (p->rc)
{
if (tag!=1)
{
q.push(p->rc);
}
else
{
cout<<"不是完全二叉树"<<endl;
exit(1);
}
}
}
cout<<"是完全二叉树"<<endl;
}
int main()
{
BinaryTree b;
b.Create(b.GiveRoot());
b.Show();
b.Judge();
return 0;
}