思想就是判断左右子树的值是否相等,递归判断左子树的右子树对比右子树的左子树,左子树的左子树对比右子树的右子树。
如果两边同时递归到了空的值,就返回true。如果只有一边到了空,就返回false。
/*
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;
}
boolean iftrue=compareer(pRoot.left,pRoot.right);
return iftrue;
}
boolean compareer(TreeNode left,TreeNode right){
if(left==null&&right==null){
return true;
}
if(left==null||right==null)
{
return false;
}
return left.val==right.val&&compareer(left.left,right.right)&&compareer(left.right,right.left);
}
}