101.对称二叉树（通过）Python

用的递归
在第100题的基础上改一改就可以了

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

class Solution:
    def isSymmetric(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        if root is not None:
            res = self.isSame(root.left,root.right)
            return res
        else:
            return True

    def isSame(self,p,q):
        if p == None and q == None:
            return True
        elif p is not None and q is not None:
            if p.val == q.val:
                return self.isSame(p.left,q.right) and self.isSame(p.right,q.left)
            else:
                return False
        else:
            return False