输入描述:
二叉树的镜像定义:源二叉树 
    	    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) return; TreeNode tempNode=null; Mirror(root.left); Mirror(root.right); tempNode=root.right; root.right=root.left; root.left=tempNode; } }

原文:http://www.cnblogs.com/wuguanglin/p/Mirror.html