LeetCode 101 对称二叉树

一：题目描述

 

二：题目解答

class Solution {
    public boolean isSymmetric(TreeNode root) {
        return isMirro(root,root);
    }  
    public boolean isMirro(TreeNode rootLeft,TreeNode rootRight){
        if(rootLeft==null&&rootRight==null){
            return true;
        }
        if(rootLeft==null||rootRight==null)
            return false;
        return (rootLeft.val==rootRight.val)
            &&(isMirro(rootLeft.left,rootRight.right))
            &&(isMirro(rootLeft.right,rootRight.left));
    }
}