二叉树复制、交换左右子树

复制二叉树

 btree* copy(btree* T)
 {
 	btree* newT = new btree;
 	if(!T)
 		return NULL;
 	else{
 		newT->lchild = copy(T->lchild);
 		newT->rchild = copy(T->rchild);
	}
	newT->data = T->data;
 	return newT;
 }

交换二叉树中每个结点的左右子树，其实就是copy函数中调换一下copy左右子树的顺序

btree* exchange(btree* T)
{
	btree* newT=new btree;
	if(!T)
		return NULL;
	else{
		newT->lchild=exchange(T->rchild);
		newT->rchild=exchange(T->lchild);
	}
	newT->data=T->data;
	return newT;
}