题目描述
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree [1,2,2,3,4,4,3] is symmetric:
1
/ \
2 2
/ \ / \
3 4 4 3
But the following [1,2,2,null,3,null,3] is not:
1
/ \
2 2
\ \
3 3
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
//updown函数要考虑左子树的左孩子为空,且右子树的右孩子为空,但又为对称树的情况 (避免出现空结点作比较以及空结点进入递归,这样会抛异常)
//递归判断对称二叉树的关键是 左子树的左孩子要等于右子树的右孩子且左子树的右孩子要等于右子树的左孩子(同为空或者结点值相等)
class Solution {
public boolean updown(TreeNode l,TreeNode r){
if((r==null && l!=null) || (r!=null && l==null))return false;
else if(r!=null && l!=null && r.val!=l.val)return false;
else if(r!=null && l!=null && r.val==l.val)return updown(l.left , r.right)&&updown(l.right , r.left);//左子树的左孩子要等于右子树的右孩子且左子树的右孩子要等于右子树的左孩子
else return true;
}
public boolean isSymmetric(TreeNode root) {
if(root==null || (root.left==null && root.right==null))return true;
else return updown(root.left , root.right);
}
}