代码如下:
/**
* 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:
void dfs(TreeNode* root){
if(!root) return;
auto l = root -> left, r = root -> right;
root -> left = r, root -> right = l;
dfs(root -> left);
dfs(root -> right);
}
TreeNode* mirrorTree(TreeNode* root) {
dfs(root);
return root;
}
};