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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/symmetric-tree
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

递归判断，分别判断left.left和right.right、left.right和right.left是否相同。

class Solution {
    public boolean isSymmetric(TreeNode root)
    {
        if(root == null)
            return true;

        return isSym(root.left, root.right);
    }

    public boolean isSym(TreeNode left, TreeNode right)
    {
        if(left == null && right == null)
            return true;
        if(left == null || right == null)
            return false;
        if(left.val != right.val)
            return false;

        return isSym(left.left, right.right) && isSym(left.right, right.left);

    }
}