101Symmetric Tree判断对称二叉树dfs

# 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 not root:
            return True
        return self.helper(root.left,root.right)
    def helper(self,left,right):
        if not left and not right:
            return True
        if (not left and right) or  (not right and left) or (left.val != right.val):
            return False
        else:
            return self.helper(left.left,right.right) and self.helper(left.right,right.left)
        return True