二叉树交换左右子树（C语言，链式存储）

#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->data=num;
	T->left=NULL;
	T->right=NULL;
	return T;
}
struct TreeNode *add(struct TreeNode *T,int num){
	if(T==NULL){
		return createNode(num);
	}
	if(num<T->data){
		T->left=add(T->left,num);
	}else if(num>T->data){
		T->right=add(T->right,num);
	}
	return T;
}
void preOrder(struct TreeNode *T){
	if(T!=NULL){
		printf("  %d",T->data);
		preOrder(T->left);
		preOrder(T->right);
	}
}
void inOrder(struct TreeNode *T){
	if(T!=NULL){
		inOrder(T->left);
		printf("  %d",T->data);
		inOrder(T->right);
	}
}
void postOrder(struct TreeNode *T){
	if(T!=NULL){
		postOrder(T->left);
		postOrder(T->right);
		printf("  %d",T->data);
	}
}
void exchange(struct TreeNode *T){/*交换左右子树核心代码*/
	if(T!=NULL){
		struct TreeNode *temp;
		temp=T->left;
		T->left=T->right;
		T->right=temp;
		exchange(T->left);
		exchange(T->right);
	}
}
int main(){
	struct TreeNode *T;
	T=NULL;
	srand(time(NULL));
	for(int i=0;i<6;i++){
		T=add(T,rand()%100);
	}
	printf("前序遍历:");
	preOrder(T);
	printf("\n中序遍历:");
	inOrder(T);
	printf("\n后序遍历:");
	postOrder(T);
	exchange(T);
	printf("\n交换左右子树后前序遍历:");
	preOrder(T);
	printf("\n交换左右子树后中序遍历:");
	inOrder(T);
	printf("\n交换左右子树后后序遍历:");
	postOrder(T);
	return 0;
}