17数据结构—二叉树的拷贝和构造

思路：

当二叉树要拷贝构造新的二叉树时，应创建新的一个树存储空间内存等，并将要拷贝的二叉树的值，左节子数，右节子数通通遍历赋值给新的树。之后打印输出验证。

例子：

代码实现：

#include <iostream>
using namespace std;
typedef struct My_tree {
	char data;
	struct My_tree* lson;
	struct My_tree* rson;
}mytree;
mytree * copy_tree(mytree* root) {
	if(root==NULL){
		return 0;
	}
	mytree* node = (mytree*)malloc(sizeof(mytree));
	node->data = root->data;
	node->lson = copy_tree(root->lson);
	node->rson = copy_tree(root->rson);
	return node;
}
//遍历拷贝二叉树
void print_tree(mytree *myt) {
	if (myt == NULL) {
		return;
	}
	cout << myt->data;
	print_tree(myt->lson);
	print_tree(myt->rson);
}
void Create_tree() {
	mytree node1 = { 'A',NULL,NULL };
	mytree node2 = { 'B',NULL,NULL };
	mytree node3 = { 'C',NULL,NULL };
	mytree node4 = { 'D',NULL,NULL };
	mytree node5 = { 'E',NULL,NULL };
	mytree node6 = { 'F',NULL,NULL };
	mytree node7 = { 'G',NULL,NULL };
	mytree node8 = { 'H',NULL,NULL };
	node1.lson = &node2;
	node1.rson = &node6;
	node2.rson = &node3;
	node3.lson = &node4;
	node3.rson = &node5;
	node6.rson = &node7;
	node7.lson = &node8;
	mytree *mytre=copy_tree(&node1);
	print_tree(mytre);
}
int main() {
	Create_tree();
	return 0;
}

 运行效果：先序遍历（根左右）