题目
请完成一个函数,输入一个二叉树,该函数输出它的镜像。
例如输入:
4
/ \
2 7
/ \ / \
1 3 6 9
镜像输出:
4
/ \
7 2
/ \ / \
9 6 3 1
示例
输入:root = [4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
代码
- 递归法
对于一棵树,如果我们在递归遍历(DFS)的过程中交换根节点的左右子节点,就可以得到这棵树的镜像。
4 4 4
/ \ / \ / \
2 7 ==> 7 2 ==> 7 2
/ \ / \ / \ / \ / \ / \
1 3 6 9 6 9 1 3 9 6 3 1
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode mirrorTree(TreeNode root) {
if (root == null) {
return null;
}
//交换需要的临时变量
TreeNode temp = root.left;
root.left = mirrorTree(root.right);
root.right = mirrorTree(temp);
return root;
}
}
- 辅助栈
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode mirrorTree(TreeNode root) {
if (root == null) {
return null;
}
Deque<TreeNode> queue = new ArrayDeque<>();
queue.addLast(root);
while (queue.size() != 0) {
TreeNode node = queue.removeLast();
if (node.left != null) {
queue.addLast(node.left);
}
if (node.right != null) {
queue.addLast(node.right);
}
TreeNode temp = node.left;
node.left = node.right;
node.right = temp;
}
return root;
}
}
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/er-cha-shu-de-jing-xiang-lcof