复制二叉树算法详解-优快云博客

本文链接：https://blog.youkuaiyun.com/woreaijava/article/details/121879944

本文介绍了复制二叉树的算法，首先通过申请新结点空间来复制根结点，然后递归地复制左子树和右子树，实现二叉树的完全复制。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

在这里插入代码片
#include "stdio.h"
#include "malloc.h"
typedef struct node{
	char data;
	struct node *lchild,*rchild;
}Tree ,*btree;
void creat(btree *t){
	char a;
	scanf("%c",&a);
	if(a==' '){
		*t=NULL;
	}else{
		*t=(btree)malloc(sizeof(btree));
		(*t)->data=a;
		creat(&((*t)->lchild));
		creat(&((*t)->rchild));
	}
}

//先序遍历：根节点，左子树，右子树 
void display(btree t,int len){
	if(t){
		printf("%c位于第%d层\n",t->data,len);
		qian(t->lchild,len+1);
		qian(t->rchild,len+1);
	}
}
//复制二叉树 
void copy(btree t,btree *t1){
	if(t==NULL){
		*t1=NULL;
		return;
	}else{
		*t1=(btree)malloc(sizeof(btree));
		(*t1)->data=t->data;
		copy(t->lchild,(&((*t1)->lchild)));
		copy(t->rchild,(&((*t1)->rchild)));
	}
}
int main(){
	btree t=NULL,t1;
	int len=1;
	creat(&t);
	printf("原二叉树：\n");
	printf("输出：\n");
	display(t,len);
	printf("\n");
	printf("复制二叉树：\n"); 
	copy(t,&t1);
	printf("输出：\n");
	display(t1,len);
	printf("\n");
	return 0;
}