# Definition for a binary tree node
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def isSymm(self, r1, r2):
if r1 == None and r2 == None:
return True
if r1 == None or r2 == None:
return False
if r1.val != r2.val:
return False
return self.isSymm(r1.left, r2.right) and self.isSymm(r1.right, r2.left)
# @param root, a tree node
# @return a boolean
def isSymmetric(self, root):
if root == None: return True
return self.isSymm(root.left, root.right)