题目描述:
操作给定的二叉树,将其变换为源二叉树的镜像。
输入描述:
二叉树的镜像定义:源二叉树 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 {
private TreeNode Exchange(TreeNode root) {
if(root == null) {
return null;
}
TreeNode left = Exchange(root.left);
TreeNode right = Exchange(root.right);
root.left = right;
root.right = left;
return root;
}
public void Mirror(TreeNode root) {
Exchange(root);
}
}