树--复制二叉树

题目要求：

通过函数实现二叉树的复制，包括每个结点的值，以及各个子树的结构都要完全相同

思路：

如果是空树，递归结束

否则①申请新节点空间，复制根节点②递归复制左子树③递归复制右子树

代码实现： 

#include<stdio.h>
#include<stdlib.h>

typedef char BTNDataType;
typedef struct BinaryTreeNode
{
	BTNDataType data;
	struct BinaryTreeNode* left;
	struct BinaryTreeNode* right;
}BTNode;

typedef struct BinaryTree
{
	BTNode* root;
}BT;

BTNode* copy(BTNode* root1)
{
	if (root1 == NULL)//如果被复制树为空
	{
		return 0;
	}
	BT t2;
	(&t2)->root = (BTNode*)malloc(sizeof(BTNode));
	(&t2)->root->data = root1->data;
	(&t2)->root->left = copy(root1->left);
	(&t2)->root->right = copy(root1->right);
	return (&t2)->root;
}

BTNode* PrevMakeTree(BTNode* b1)
{
	char ch;
	scanf_s("%c", &ch);
	if (ch=='#')
	{
		b1 = NULL;//如果输入为#，那么代表当前节点为空节点
	}
	else
	{
		b1 = (BTNode*)malloc(sizeof(BTNode));
		b1->data = ch;
		b1->left = PrevMakeTree(b1->left);
		b1->right = PrevMakeTree(b1->right);
	}
	return b1;
}

void PrevOrder(BTNode* b1)
{
	if (b1==NULL)
	{
		return;
	}
	printf("%c ", b1->data);//根结点
	PrevOrder(b1->left);//左子树
	PrevOrder(b1->right);//右子树
}
void TreeCreate(BT* B1)
{
	B1->root = NULL;
}
int main()
{
	BT tree1;
	TreeCreate(&tree1);
	(&tree1)->root = PrevMakeTree((&tree1)->root);
	PrevOrder((&tree1)->root);
	printf("前序输出复制二叉树\n");
	PrevOrder(copy((&tree1)->root));
	return 0;
}