Leetcode 101. Symmetric Tree

题目链接：https://leetcode.com/problems/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

 

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def isSymmetric(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        if root==None: return True
        return self.Symmetric(root.left,root.right)
    def Symmetric(self,left,right):
        if left==None and right==None:
            return True
        if left==None or right==None:
            return False
        if left and right and left.val==right.val:
                return self.Symmetric(left.left,right.right) and self.Symmetric(left.right,right.left)
        return False