题目描述
请完成一个函数,输入一个二叉树,该函数输出它的镜像。
0 <= 节点个数 <= 1000
示例
输入:root = [4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
题解
1. 递归
C++
/**
* 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) {
if (root == nullptr) {return nullptr;}
TreeNode* tmp = root->left;
root->left = mirrorTree(root->right);
root->right = mirrorTree(tmp);
return root;
}
};