请完成一个函数,输入一个二叉树,该函数输出它的镜像。
例如输入:
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]
https://leetcode-cn.com/problems/er-cha-shu-de-jing-xiang-lcof/
本题同样可以有两种解法递归、栈
核心就是交换左右子树节点
public class Test27 {
//递归
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;
}
//栈
public TreeNode mirrorTree2(TreeNode root) {
if (root == null)
return null;
Stack<TreeNode> stack = new Stack<>();
stack.push(root);
while (!stack.isEmpty()) {
TreeNode node = stack.pop();
if (node.left != null)
stack.push(node.left);
if (node.right != null)
stack.push(node.right);
//交换左右子树节点
TreeNode temp = node.left;
node.left = node.right;
node.right = temp;
}
return root;
}
}