leetcode简单题(一) —— 镜像二叉树

一、问题描述

二、代码实现

typedef struct Tree{
	int data;
	struct Tree *left = NULL;
	struct Tree *right = NULL; 
}*BTree;

BTree mirro(BTree root){
	if(root == NULL){
		return NULL;
	}
	BTree left = mirro(root->left);
	BTree right = mirro(root->right);
	root->left = right;
	root->right = left;
	return root;
}