利用队栈,判断是否为完全二叉树
bool isFullBiTree(node* tree)
{
deque<node*> q;
if (!tree) return true;
node* t=tree;
q.push_back(t);
while (!q.empty())
{
t=q.front();
q.pop_front();
if (t)
{
q.push_back(t->lchild);
q.push_back(t->rchild);
}
else
{
while (!q.empty())
{
t=q.front();
q.pop_front();
if (t) return false;
}
}
}
return true;
}