题意
请完成一个函数,输入一个二叉树,该函数输出它的镜像。
题解
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* mirrorTree(TreeNode* root) {
recur(root);
return root;
}
void recur(TreeNode* root){
if(root == NULL) return;
recur(root->left);
recur(root->right);
TreeNode* tmp = root->left;
root->left = root->right;
root->right = tmp;
}
};