请完成一个函数,输入一个二叉树,该函数输出它的镜像。
例如输入:
4
/ \
2 7
/ \ / \
1 3 6 9
镜像输出:
4
/ \
7 2
/ \ / \
9 6 3 1
示例 1:
输入:root = [4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
限制:
0 <= 节点个数 <= 1000
思路:
同[leetcode]226.翻转二叉树
AC代码:(C++)
dfs:
class Solution {
public:
TreeNode* mirrorTree(TreeNode* root) {
dfs(root);
return root;
}
void dfs(TreeNode* root) {
if (root != nullptr) {
swap(root->left, root->right);
dfs(root->left);
dfs(root->right);
}
}
};
bfs:
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
if (root == NULL) return NULL;
queue<TreeNode*> q;
q.push(root);
while (!q.empty()) {
TreeNode* temp = q.front();
q.pop();
if (temp != NULL) {
swap(temp->left, temp->right);
q.push(temp->left);
q.push(temp->right);
}
}
return root;
}
};