#include<stdio.h>
#include<stdlib.h>
#include<time.h>
struct TreeNode{
int data;
struct TreeNode *left;
struct TreeNode *right;
};
struct TreeNode *createNode(int num){
struct TreeNode *T;
T=(struct TreeNode *)malloc(sizeof(struct TreeNode));
T->left=NULL;
T->right=NULL;
T->data=num;
return T;
}
struct TreeNode *createTree(struct TreeNode *T,int num){
if(T==NULL){
return createNode(num);
}
if(T->data>num){
T->left=createTree(T->left,num);
}else if(T->data<num){
T->right=createTree(T->right,num);
}
return T;
}
struct TreeNode *TreeCopy(struct TreeNode *T){/*复制的核心代码*/
struct TreeNode *copyT;
if(T==NULL){
copyT=NULL;
}else{
copyT=createNode(T->data);
copyT->left=TreeCopy(T->left);
copyT->right=TreeCopy(T->right);
}
return copyT;
}
void preOrder(struct TreeNode *T){
if(T!=NULL){
printf("\t%d",T->data);
preOrder(T->left);
preOrder(T->right);
}
}
void inOrder(struct TreeNode *T){
if(T!=NULL){
inOrder(T->left);
printf("\t%d",T->data);
inOrder(T->right);
}
}
void postOrder(struct TreeNode *T){
if(T!=NULL){
postOrder(T->left);
postOrder(T->right);
printf("\t%d",T->data);
}
}
int main(){
struct TreeNode *T,*copyT;
T=NULL;
srand(time(NULL));
for(int i=0;i<12;i++){
T=createTree(T,rand()%40);
}
printf("原二叉树:\n前序遍历:");
preOrder(T);
printf("\n中序遍历:");
inOrder(T);
printf("\n后序遍历:");
postOrder(T);
copyT=TreeCopy(T);
printf("\n复制的二叉树:\n前序遍历:");
preOrder(copyT);
printf("\n中序遍历:");
inOrder(copyT);
printf("\n后序遍历:");
postOrder(copyT);
return 0;
}
二叉树的复制(C语言)
最新推荐文章于 2023-12-26 22:28:10 发布