c语言实现二叉树拷贝

递归实现二叉树拷贝，注意新的二叉树要再开辟空间( 感觉类似深拷贝原理)。

main.c

#include<stdio.h>
#include<stdlib.h>
#include<vld.h>
typedef struct BINARYNODE
{
	char data;
	struct BINARYNODE* lchild;
	struct BINARYNODE* rchild;

}BinaryNode;

//遍历二叉树
void Recursion(BinaryNode* root)
{
	if (root == NULL)
	{
		return;
	}

	Recursion(root->lchild);

	Recursion(root->rchild);

	printf("%c ", root->data);
}

BinaryNode* CopyBinaryTree(BinaryNode* root)
{
	if (root == NULL)
	{
		return NULL;
	}

	//拷贝左子树
	BinaryNode* lchild = CopyBinaryTree(root->lchild);
	BinaryNode* rchild = CopyBinaryTree(root->rchild);

	//创建结点
	BinaryNode* newnode = malloc(sizeof(BinaryNode));
	newnode->data = root->data;
	newnode->lchild = lchild;
	newnode->rchild = rchild;

	return newnode;
}

//释放二叉树内存
void FreeSpaceBinaryTree(BinaryNode* root)
{
	if (root == NULL)
	{
		return;
	}

	FreeSpaceBinaryTree(root->lchild);
	FreeSpaceBinaryTree(root->rchild);

	free(root);
}

int main()
{
	//创建结点
	BinaryNode node1 = { 'A',NULL,NULL };
	BinaryNode node2 = { 'B',NULL,NULL };
	BinaryNode node3 = { 'C',NULL,NULL };
	BinaryNode node4 = { 'D',NULL,NULL };
	BinaryNode node5 = { 'E',NULL,NULL };
	BinaryNode node6 = { 'F',NULL,NULL };
	BinaryNode node7 = { 'G',NULL,NULL };
	BinaryNode node8 = { 'H',NULL,NULL };

	//建立结点关系
	node1.lchild = &node2;
	node1.rchild = &node6;
	node2.rchild = &node3;
	node3.lchild = &node4;
	node3.rchild = &node5;
	node6.rchild = &node7;
	node7.lchild = &node8;

	BinaryNode* root =  CopyBinaryTree(&node1);

	//遍历二叉树
	Recursion(&node1);
	printf("\n");
	Recursion(root);

	FreeSpaceBinaryTree(root);

	system("pause");
	return 0;
}

测试结果：