//生成一个二叉树的结点
BiTNode *GetTreeNode(TElemType item,BitNode *lptr,BiTNode *rptr)//数据域,左指针,右指针
{
if(!(T = (BiTNode *)malloc(sizeof(BiTNode))))//分配空间
exit(1);
T->data = item;//数据域的分配
T->lchild = lptr;
T->rchild= rptr;
return T;
}
//复制二叉树
BiTNode *CopyTree(BitNode *T)
{
if(!T)
return NULL;
if(T->lchild)
newlptr = CopyTree(T->lchild);//复制左子树
else newlptr = NULL;
if(T->rchild)
newrptr = CopyTree(T->rchild);//复制右子树
else newrptr = NULL;
newnode = GetTreeNode(T->data,newlptr,newrptr);
return newnode;
}