void CopyBiTree(BiTree T, BiTree &TT) /* 基于层次遍历的非递归复制二叉链表 */
{
QElemType p;
Queue t2,tt2;
InitQueue(t2);
InitQueue(tt2);
if(!T) TT=NULL;
else
{ EnQueue(t2,T);
if(!(TT=(BiTNode*)malloc(sizeof(BiTNode))))exit(OVERFLOW);
p=TT; p->data=T->data; p->lchild=p->rchild=NULL; EnQueue(tt2,p);
while(!QueueEmpty(t2))
{
DeQueue(t2,T); DeQueue(tt2,p);
if(T->lchild)
{ EnQueue(t2,T->lchild);
if(!(p->lchild=(BiTNode*)malloc(sizeof(BiTNode))))exit(OVERFLOW);
p->lchild->data=T->lchild->data;
p->lchild->lchild=p->lchild->rchild=NULL;
EnQueue(tt2,p->lchild);
}
if(T->rchild)
{ EnQueue(t2,T->rchild);
if(!(p->rchild=(BiTNode*)malloc(sizeof(BiTNode))))exit(OVERFLOW);
p->rchild->data=T->rchild->data;
p->rchild->lchild=p->rchild->rchild=NULL;
EnQueue(tt2,p->rchild);
}
} //end of while
} //end of else
}