leetcode 101 symmetric tree recursive approach

program5.py

# 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: TreeNode) -> bool:
        if(root==None):
            return True
        else:
             return self.check(root.left,root.right)

    def check(self,left,right):
        if(left==None and right==None):
            return True
        elif(left!=None and right!=None):
            return (left.val==right.val) and self.check(left.left,right.right) and self.check(left.right,right.left)
        else:
            return False