剑指Offer_18_二叉树的镜像

题目描述

二叉树的镜像定义：源二叉树
8
/  \
6   10
/ \  / \
5  7 9 11
镜像二叉树
8
/  \
10   6
/ \  / \
11 9 7   5

解题思路

实现

/*树结点的定义*/
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){
TreeNode left = root.left;
root.left = root.right;
root.right = left;
Mirror(root.left);
Mirror(root.right);
}
}
}