标签：ret esc stack roo mirror treenode null highlight new
题目描述:操作给定的二叉树，将其变换为源二叉树的镜像。
输入描述:
二叉树的镜像定义：源二叉树
8
/ 6 10
/ \ / 5 7 9 11
镜像二叉树
8
/ 10 6
/ \ / 11 9 7 5
实现语言：Java
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
public void Mirror(TreeNode root) {
if(root==null){
return;
}else{
TreeNode tmp=root.left;
root.left=root.right;
root.right=tmp;
Mirror(root.left);
Mirror(root.right);
}
}
}
实现语言：Java
/**
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.Stack;
public class Solution {
public void Mirror(TreeNode root) {
if(root==null){
return;
}
Stack<TreeNode> stk=new Stack<TreeNode>();
stk.push(root);
while(!stk.isEmpty()){
root=stk.pop();
if(root.left!=null||root.right!=null){
TreeNode tmp=root.left;
root.left=root.right;
root.right=tmp;
}
if(root.left!=null){
stk.push(root.left);
}
if(root.right!=null){
stk.push(root.right);
}
}
}
}
标签：ret esc stack roo mirror treenode null highlight new
原文地址：https://www.cnblogs.com/xidian2014/p/10196541.html
