/*
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 isMirror(pRoot.left, pRoot.right);
}
public boolean isMirror(TreeNode left, TreeNode right){
if(left == null && right == null){//只有一个节点,可以说是对称的,返回true
return true;
}
if(left != null && right != null){
if(left.val == right.val){
return isMirror(left.left, right.right) && isMirror(left.right, right.left);//镜面的比较
}
}
return false;
}
}