题目描述:
代码如下:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean isSymmetric(TreeNode root) {//判断镜像对称
if(root==null){
return true;
}
return isEquals(root.left,root.right);
}
boolean isEquals(TreeNode left,TreeNode right){//判断左右镜像相等 考虑当前 其他交给递归处理
if(left==null&&right==null){
return true;
}
if(left==null||right==null||left.val!=right.val){
return false;
}
return isEquals(left.left,right.right)&&isEquals(left.right,right.left);
}
}