Day42 Map03

1. 给定一棵二叉树，判断它是不是镜像对称的。 比如：
   
   这是镜像对称的
   
   这不是镜像对称的

   public class TreeNode {		
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { 
    val = x; } 
    }
   

class Solution {
    public boolean isSymmetric(TreeNode root) {
        return isMirrorSymmetry(root,root);
    }

        public boolean isMirrorSymmetry(TreeNode tree1, TreeNode tree2) {
        if (tree1 == null && tree2 == null) {
            return true;
        }
        if (tree1 == null || tree2 == null ) {
            return false;
        }
        return tree1.val == tree2.val && isMirrorSymmetry(tree1.left, tree2.right) && isMirrorSymmetry(tree1.right, tree2.left);
    }
}