二叉树的镜像定义:源二叉树 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 { TreeNode root_copy=null; public void Mirror(TreeNode root) { if(root==null){ return ; } //遍历左子树 Mirror(root.left); //遍历右子树 Mirror(root.right); root_copy=root.left; root.left=root.right; root.right=root_copy; } }