剑指 Offer 27. 二叉树的镜像
请完成一个函数,输入一个二叉树,该函数输出它的镜像。
例如输入:
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
解法一:dfs遍历 左右交换
/**
* 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 left = mirrorTree(root.left);
TreeNode right = mirrorTree(root.right);
//从 叶子结点开始交换
root.left = right;
root.right = left;
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;
Stack<TreeNode> st = new Stack<>();
st.add(root);
while(st.size() > 0){
TreeNode node = st.pop();
if (node.left != null) st.add(node.left);
if (node.right != null) st.add(node.right);
TreeNode tem = node.left;
node.left = node.right;
node.right = tem;
}
return root;
}
}
- 创建者:师晓峰
- 创建时间:2022/6/8 20:25