题目链接
https://leetcode.cn/problems/er-cha-shu-de-jing-xiang-lcof/
思路
代码
/**
* 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 tmp=null;
// tmp=mirrorTree(root.left);
// root.left=mirrorTree(root.right);
// root.right=tmp;
// return root;
// }
// }
//方法二
class Solution {
public TreeNode mirrorTree(TreeNode root) {
if(root == null) return null;
Stack<TreeNode> stack = new Stack<>();
stack.add(root);
while(!stack.isEmpty()) {
TreeNode node = stack.pop();
if(node.left != null) stack.add(node.left);
if(node.right != null) stack.add(node.right);
TreeNode tmp = node.left;
node.left = node.right;
node.right = tmp;
}
return root;
}
}