用递归实现:void PrintBiTree(BiTree T){ cout< LayerTraverse(T,printelem); cout<}void CopyBiTree(BiTree T,BiTree &M){ if (!T) M=T; else{ M=new BiTNode; M->data=T->data; CopyBiTree (T->lchild,M->lchild); CopyBiTree(T->rchild,M->rchild); }}