[LeetCode]题解（python）：101 Symmetric tree

 1 # Definition for a binary tree node.
 2 # class TreeNode(object):
 3 #     def __init__(self, x):
 4 #         self.val = x
 5 #         self.left = None
 6 #         self.right = None
 7 
 8 class Solution(object):
 9     def isSymmetric(self, root):
10         """
11         :type root: TreeNode
12         :rtype: bool
13         """
14         def help(p, q):
15             if p == None and q == None:
16                 return True
17             if p and q and p.val == q.val:
18                 return help(p.left, q.right) and help(p.right, q.left)
19             return False
20         
21         if root:
22             return help(root.left, root.right)
23         return True
24