101. Symmetric Tree

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

判断一棵树是否对称，根节点不需要判断，所以，只需要判断他的左孩子和右孩子是否是镜像关系即可。
如何判断两棵树是镜像关系： 根节点相同，A树的左孩子等于B树的右孩子，A树的右孩子等于B树的左孩子。

class Solution {
    public boolean isSymmetric(TreeNode root) {
        if (root == null) {
            return true;
        }
        return isMirror(root.left, root.right);
    }
    
    private boolean isMirror(TreeNode node1, TreeNode node2) {
        if (node1 == null && node2 == null) {
            return true;
        }
        if (node1 == null || node2 == null) {
            return false;
        }
        return node1.val == node2.val 
                && isMirror(node1.left, node2.right) 
                && isMirror(node1.right, node2.left);
    }
}