题目描述
思路分析
递归进行左右子树的互换即可
代码展示
/**
* 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 == NULL) {
return NULL;
}
TreeNode* Left = mirrorTree(root->left);
TreeNode* Right = mirrorTree(root->right);
root->left = Right;
root->right = Left;
return root;
}
};
结果分析
时间复杂度O(N)
空间复杂度O(N)