题目描述 请实现一个函数,用来判断一颗二叉树是不是对称的。注意,如果一个二叉树同此二叉树的镜像是同样的,定义其为对称的。 [java] view plain copy /* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } */ public class Solution { boolean isSymmetrical(TreeNode pRoot){ if(pRoot==null) return true; return solve(pRoot.left, pRoot.right); } boolean solve(TreeNode left,TreeNode right){ if(left==null && right==null) return true; if(left!=null && right==null) return false; if(left==null && right!=null) return false; if(left.val!=right.val) return false; return solve(left.left, right.right) && solve(left.right, right.left); } } 原文链接 http://blog.csdn.net/crazy__chen/article/details/45102101